Topic outline

  • Discrete Mathematics : the journey begins here.

    ABOUT COURSE

    WELCOME AUDIO/VIDEO MESSAGE

    INSTRUCTOR INFORMATION

    Course Instructor Details

    OFFICE/COUNSELING HOUR

    Office Hour and Counselling Hour : Click to find out my Office Hour and Counselling Hour

    INSTRUCTION/GUIDELINE FOR THE COURSE

      • All the students registered for this course have to enroll in Moodle
      • Students can find all the course materials from Moodle.
      • All the students have to submit the soft copy of their "Assignment " in Moodle under  assignment  section created here and for this they will be graded here.
      • One discussion or feedback forum is created under each of the lecture. Students have to give their feedback on these forum and marks will be given for their feedback
      • Announcement regarding the class will be posted on Moodle. 
      • Quizzes and presentation  may be held on face to face class and may be few of the class will be held on online (Moodle) and it will be announced before the class
      • The question pattern and the syllabus for the quizzes, midterm and final exam is given here under each of the section (quizzes, midterm and final)
      • There are midterm and final exam preparation  forum under these sections where students can discuss with each other about their midterm and final exam syllabus, any problem regarding the exam etc.

      COURSE RATIONALE

      Concepts and notations from discrete mathematics are useful in studying and describing objects and problems in all branches of computer science, such as computer algorithms, programming languages, cryptography, automated theorem proving, and software development. It helps improving reasoning power and problem-solving skills. Therefore, it can be considered as the backbone of computer science.

      COURSE OBJECTIVE

      • The goal of this course is to introduce students to ideas and techniques from discrete mathematics that are widely used in science and engineering for thinking logically and mathematically and apply these techniques in solving problems.
      • To achieve this goal, students will learn logic and proof, sets, functions, mathematical reasoning as well as key topics involving relations, graphs and trees.

      COURSE OUTCOME

      After completing this course satisfactorily, a student will:

      CO1

      Be able to comprehend formal logical arguments as well as to construct logical proofs with ability to verify them

      CO2

      Demonstrate skills in expressing mathematical properties formally via the formal language of propositional logic and predicate logic

      CO3

      Gain experience in using various techniques of mathematical induction to prove simple mathematical properties of a variety of discrete structures

      CO4

      Be able to specify and manipulate basic mathematical objects such as sets, functions, and relations and will also be able to verify simple mathematical properties that these objects possess

      CO5

      Demonstrate knowledge on some basic properties and types of graphs and trees and will also be able to apply it to solve fundamental engineering problems

       


      ASSESSMENT PLAN


      COURSE OUTLINE

      REFERENCE TEXTBOOKS

      ADDITIONAL MATERIALS

      Join Telegram Course Group:  https://t.me/joinchat/LYMi-hmKEnK_-HZsYGXN3Q
      Students Guideline for DIU BLC:  http://gg.gg/moodle-student
      Google Classroom Code: 6l2garl

      • Attendance

        A new session will be created before each class to take the attendance. Students will be able to give their attendance by their own after joining the class withing the class period.

        • Online class schedule of Discrete Mathematics course in Summer-2020

          • Online class schedule of Discrete Mathematics Course with in Summer-2020

            Meeting Link: meet.google.com/syy-hzby-wsp

            Class Time: Tuesday(8:30am-10:00am)

                                     Wednesday(10:00am-11:30am)

        • Week 1

          LESSON OBJECTIVE

          Lesson 1

          • In this lesson, discrete mathematics will be introduced and a discussion on propositional logic will be initiated.

          Lesson 2

          • In this lesson, a discussion on propositional logic will be continued.


          LEARNING OUTCOME

          • Students will understand what makes up a correct mathematical argument
          • Students will be able to develop an arsenal of different proof methods that will enable students to prove many different types of results
          • Students will be able to explain the process of developing mathematics. 
          • They will get the concept about propositional logic and why this logic is used in Computer Science. 
          • They will get an overview why Discrete Mathematics  is important in building the logic in Computer Science.

          LECTURE CONTENT

          PRE-VIDEO LECTURE

        • Week 2

          LESSON OBJECTIVE

          Lesson 3

          • In this lesson, discussion on propositional logic will be continued with the topic of logical equivalence

          Lesson 4

          • In this lesson, a discussion on predicates and quantifiers in propositional logic will be introduced.


          LEARNING OUTCOME

          • correct mathematical argument and introduce tools to construct these arguments
          • different proof methods
          • several strategies for constructing proofs
          • the notion of a conjecture and the process of developing mathematics by studying conjectures
          • truth table and strategies for constructing logical equivalence

          LECTURE CONTENT

          PRE-VIDEO LECTURE

        • Week 3

          LESSON OBJECTIVE

          Lesson 5

          • In this lesson, a discussion on predicates and quantifiers in propositional logic will be continued

          Lesson 6

          • In this lesson, a discussion on sets and its operations will be introduced


          LEARNING OUTCOME

          • After this lecture students will get clear conception about Predicates and Quantifiers  
          • They will be able to represent a sentence using Predicates and Quantifiers . 
          • They will also get a basic concept of set, set operations and why set is used in Discrete Mathematics

          LECTURE CONTENT

          PRE-VIDEO LECTURE

        • Week 4

          LESSON OBJECTIVE

          Lesson 7

          • In this lesson, a discussion on sets and its operations will be continued

          Lesson 8

          • In this lesson, a discussion on functions and its usage will be introduced


          LEARNING OUTCOME

          • After the lecture students will be able to learn why set is important in discrete mathematics and different operation of sets.
          • They will also get the idea of functions, its importance, use of function
            • >

          LECTURE CONTENT

          PRE-VIDEO LECTURE

        • Week 5

          LESSON OBJECTIVE

          Lesson 9

          • In this lesson, a discussion on functions and its usage will be continued

          Lesson 10

          • In this lesson, a discussion on mathematical induction and its usage will be introduced


          LEARNING OUTCOME

          • After the lecture students will be able to learn details about functions and its usage in Discrete Mathematics
          • They also understand the purpose of Mathematical Induction
            • >

          LECTURE CONTENT

          PRE-VIDEO LECTURE

        • Week 6

          LESSON OBJECTIVE

          Lesson 11

          • In this lesson, a discussion on relations and its operations will be introduced

          Lesson 12

          • In this lesson, a discussion on relations and its closure operations will be continued


          LEARNING OUTCOME

          • After this lecture students will get clear conception about Relations
          • Properties and Representations of relation in Discrete Mathematics
            • >

          LECTURE CONTENT

          PRE-VIDEO LECTURE

        • Midterm survey of the course [just before midterm]


        • Midterm Exam

          • Open Book Exam Guidelines for Students

          • Exam Guidelines

            • Exam Date: 9th July, 2020
            • Exam Time: 2:00pm-6:00pm
            • You need to download (1) TK_CSE131_PC-B_Mid.pdf and (2) CSE131_Answer Script_Mid.doc
            • See and follow the open book exam guidelines
            • Do not share as this will be treated as plagiarism by Blended Learning Center.
            • You will type your answers in the answer script doc file and save as pdf with your ID e.g. CSE131-PC-B-111-15-2345-mid.pdf (Course Code-Section-Student ID) and upload in the BLC within the given time frame.

          • Midterm Exam Assignment
            Make a submission

            Click to start your exam

        • Week 8

          • LECTURE CONTENT

          • Lesson 13

            In this lesson, a discussion on graphs  will be introduced.

            Lectures

          • Lesson 14

            In this lesson, a discussion on bipartite graph and its applications  will be introduced.

            Lectures

          • OUTCOME OF THE LECTURE

          • Outcome of the week Lecture

            • After this lecture students will get clear conception about Pair, Ordered Pair, Graph, Edge 
            • Different kind of graph, different ways of representing graph, Bipartite Graph 
            • will be able to find out whether a graph is bipartite or not

          • PRE-VIDEO LECTURE

          • RECORDED VIDEO LECTURE

          • WEEKLY ASSIGNMENT

          • Assignment on Week 8 Quiz
            Receive a grade

          • DISCUSSION FORUM

        • Week 9

          • LECTURE CONTENT

          • Lesson 15

            In this lesson, a discussion on various graph terminologies will be introduced.

            Lectures

          • Lesson 16

            In this lesson, a discussion on isomorphism  on graphs will be introduced.

            Lectures

          • Outcome of the week Lecture

            After this lecture students will get clear conception about 
            • Difference between different types of Graph
            • Handshaking Theorem
            • How to find degree of graph
            • Cycle, Wheel, Complete Graph
            • different ways of representing graph
            • will get clear conception about Isomorphism and they will be able to find out whether a graph is Isomorphic or not

          • PRE-VIDEO LECTURE

          • RECORDED VIDEO LECTURE

          • WEEKLY ASSIGNMENT

          • Assignment on Week 9
            Make a submission

          • DISCUSSION FORUM

        • Week 10

          • LECTURE CONTENT

          • Lesson 17

            In this lesson, a discussion on  different graph representations will be introduced.

            Lectures

          • Lesson 18

            In this lesson, a discussion on  Euler paths in graph will be introduced.

            Lectures

          • Outcome of the week Lecture

            • After this lecture students will get clear conception about Euler Path and Circuit 
            • will be able to find out whether a graph is Euler Path/Circuit or not

          • PRE VIDEO LECTURE

          • WRITTEN EXPLANATION OF THE LECTURE

          • RECORDED CLASS LECTURE 

          • WEEKLY ASSIGNMENT

          • WEEKLY DISCUSSION FORUM

        • Week 11

          • LECTURE CONTENT

          • Lesson 19

            In this lesson, a discussion on  Hamilton paths in graph will be introduced.

            Lectures

          • Lesson 20

            In this lesson, a discussion on  shortest path problems in graph will be introduced.

            Lectures

          • Outcome of the week Lecture

            • After this lecture students will get clear conception about Hamilton Path and Circuit
            • will be able to find out whether a graph is Hamilton Path/Circuit or not. 
            • They will also understand shortest path algorithm and real life implementation of shortest path.

          • PRE-VIDEO AND WRITTEN LECTURE

          • RECORDED CLASS LECTURE

          • WEEKLY ASSIGNMENT

          • WEEKLY DISCUSSION FORUM

        • Week 12

          • Lesson 21

            In this lesson, a discussion on trees will be introduced.

            Lectures

          • Lesson 22

            In this lesson, a discussion on spanning trees will be introduced.

            Lectures

          • Outcome of the week Lecture

            After this lecture students will get clear conception about Tree and Minimum Spanning Tree

          • NOTICE

          • PRE CLASS VIDEO LECTURE

          • RECORDED CLASS VIDEO LECTURE

          • WEEKLY ASSIGNMENT

          • Presentation Assignment
            Make a submission

          • WEEKLY FORUM TO DISCUSS

        • Week 13

          • Lesson 23

            In this lesson, a discussion on  finding the minimum spanning trees will be introduced.

            Lectures

          • Review for Final

            In this lesson, a review on all the topics will be provided.


          • NOTICE

          • Since your final exam will be started on 20 August that's why our official last class will be held on 18-08-2020. Our class on 19 August will be postponed because of your final exam preparation. Contact with me if anything is needed.

          • PRE CLASS VIDEO LECTURE

          • RECORDED CLASS VIDEO LECTURE

          • THIRD QUIZ

          • WEEKLY FORUM TO DISCUSS

        • Week 14

          ***Final Exam***

          Exact dates will be announced later.

          • Final Exam includes: 


          • Final Exam Preparation:

            • Discuss with each other and find the problems regarding upcoming midterm examination
            • Try to solve the problems of each other
            • Try to solve previous semester questions which has been uploaded in google classroom
            • If you have any problems that you can not solve, then inform me and we will discuss it in the classroom

        • Final Exam Summer-20