Weekly outline

  • Discrete Mathematics : the journey begins here.


    • Dear Students,

      Welcome to the course CSE3131(Discrete Mathematics ) !! . I am looking forward to the opportunity so we will have to learn and grow together in this course.  I always believe that your success is most important to me as a teacher.  Please don’t hesitate to contact me in case of having difficulties with the course materials and any other academic problems. To smooth this operation, general questions related to the courses should be posted on the Discussion Forum. Success in an online class requires just as much work and effort as success in a traditional classroom. Lastly, I am expecting much cooperation from all of you. Hope we will enjoy this journey joyfully.

      Stay safe and healthy. Thanks all of you for joining with this course.

      Best Regards,

      Md. Rahmatul Kabir Rasel Sarker
      Lecturer, Dept. of CSE
      Daffodil International University   


    •                                 Teacher Information
      Instructor Name: Rahmatul Kabir Rasel Sarker
      Designation: Lecturer
      Dept. of CSE
      Cell-Phone: 01761918875
      Email: raselsarker.cse@diu.edu.bd
      Google Site : https://sites.google.com/diu.edu.bd/rkrsarker


    •                                       One-click find me
                                                      
      		                                                           
    •                                            Telegram Link
      •            Section-PC- E       
      •                                                      
      •                 Section-B              

               

    •                                                                              Semester Timeline 


    • Routine and Counselling Hour



    • 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 Outcomes (CO’s)

      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

  • Google Meet Class Record

    • Introduction to Discrete Mathematics 

       
       

  • Week 1 : Propositional Logic

    • Lesson 1

      Discussion Topics

      • Introduction 
      • Introduction to Discrete Mathematics
      • Propositional Logic  

      Learning Outcomes

      • Overview of Discrete Mathematics.
      • Learn about Propositional logic 

      Lecture Video

       

       

    • Lesson 2

      Discussion Topics

      • Converse, Contrapositive and Inverse
      • Bi-conditional Statement
      • Compound Propositions
      • Bit Operations

      Learning Outcomes

      • Learn about different types of Propositions
      • Learn about Bit Operations 

      Lectures

      Lecture Video 

       

       

    • Self Practice Assignment
      Opened: Wednesday, 10 August 2022, 12:00 AM
      Due: Wednesday, 17 August 2022, 12:00 AM

  • Week 2 : Propositional Equivalences

    • Lesson 3

      Discussion Topics

      • Propositional Equivalences
      • Tautology, Contradiction and Contingency
      • Logical Equivalence

      Learning Outcomes

      • Learn about Propositional Equivalences
      • Learn about Tautology, Contradiction and Contingency

      Lectures

      Lecture Video

       

       

    • Lesson 4

      Discussion Topics

      • Propositional Predicates and Quantifiers 

      Learning Outcomes

      • Learn about Predicates and Quantifiers 

      Lectures

    • Assignment 01
      Opened: Monday, 8 August 2022, 12:00 AM
      Due: Saturday, 13 August 2022, 12:00 AM

  • Week 3 : Predicates and Quantifiers

    • Lesson 5

      Discussion Topics

      • Predicates and Quantifiers will be continue 
      • Universal Quantification
      • Existential Quantification

      Learning Outcomes

      • Learn about Universal Quantification
      • Learn about Existential Quantification 
      • Learn about the difference between Universal Quantification and Existential Quantification 

      Lectures

      Video Lecture

       

       

    • Lesson 6

      Discussion Topics

      • Sets and Its operation.

      Learning Outcomes

      • Understanding the important of sets 
      • Understanding the basic set operations

      Lectures

      Lecture Video

       

       

  • Week 4: Set Operations

    • Lesson 7

      Discussion Topics

      • Sets and Its operations
      • Venn Diagram

      Learning Outcomes

      • Learn different types of set operations.
      • Understanding the venn diagram for set operations 

      Lectures

       

       

    • Lesson 8

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

      Lectures

    • Assignment 1
      Opened: Wednesday, 14 September 2022, 12:00 AM
      Due: Thursday, 15 September 2022, 9:00 PM

  • Week 5: Functions

  • Week 6: Relations, Their Properties and Representations

    • Lesson 11

      Discussion Topics

      • Relations 
      • Different types of relations

      Learning Outcomes

      • Learn Relations
      • Understanding different relations

      Lectures

      Reference Video 

       

       

    • Lesson 12

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

      Lectures

    • Quiz -02
      Opened: Saturday, 10 September 2022, 8:00 PM
      Closed: Saturday, 10 September 2022, 10:10 PM
      View


      Quiz Password : quiz2

  • Introduction to Graph

    • Lesson 13

      Discussion Topics

      • Introduction to Graph
      • Different types of Graph

      Learning Outcomes

      • Learn about Introduction to Graph
      • Compare between different Graphs

      Lectures

      Reference Video
       

       

    • Lesson 14

      Discussion Topics

      • Bipartite graph
      • its applications.

      Learning Outcomes

      • Learn about bipartite graph
      • Learn its applications

      Lectures

    • Assignment-03
      Opened: Friday, 7 October 2022, 12:00 AM
      Due: Friday, 14 October 2022, 12:00 AM
    • Forum Discussion

  • Graph Cont...

  • Graph(Euler Path and Circuit)

    • Lesson 17

      Discussion Topics

      • Introduction to Graph
      • Graph Representation

      Learning Outcomes

      • Learn about introduction to Graph
      • Understand about graph representation

      Lectures

      Class Record:

    • Lesson 18

      Discussion Topics

      • Introduction to Euler Circuits and Path
      • Constructing an Euler Circuit and Path

      Learning Outcomes

      • Learn about Introduction to Euler Circuits and Path
      • Learn about constructing an Euler Circuit and Path

      Lectures

      Class Record:

    • Class Record Folder

  • Shortest Path Problem & Algorithm

    • Lesson 19

      Discussion Topics

      • Theorem of Hamilton Circuits and Path
      •  Construction an Hamilton Circuit and Path

      Learning Outcomes

      • Understand about Theorem of  Hamilton Circuits and Path
      • Learn about constructing an Hamilton Circuit and Path
      • Understand about various Theorem

      Lectures

      Class Record:


    • Lesson 20

      Discussion Topics

      • Introduction to Shortest Path problems in graph
      • Constructing Dijkstra’s Algorithm
      •  Introduction Floyd’s Algorithm

      Learning Outcomes

      • Understand about Shortest Path problems in graph
      • Learn about constructing Floyd’s Algorithm
      • Understand about Constructing Dijkstra’s Algorithm

      Lectures

      Reference Video: 

       

       

    • Quiz 3 (PC-L) Assignment
      Opened: Thursday, 27 October 2022, 8:00 PM
      Due: Thursday, 27 October 2022, 9:00 PM


    • Quiz 3(PC-R) Assignment
      Opened: Thursday, 27 October 2022, 8:00 PM
      Due: Thursday, 27 October 2022, 9:00 PM


    • Assignment On MST and Dijkstra
      Opened: Saturday, 26 November 2022, 12:00 AM
      Due: Wednesday, 30 November 2022, 11:00 PM

  • Introduction To Trees

    • Lesson 21

      Discussion Topics

      • Introduction to Trees
      • m-ary Tree , Subtree ,Forest
      • Level and Height
      • Balanced Tree

      Learning Outcomes

      • Learn about Introduction to Trees
      • Understand about m-ary Tree , Subtree ,Forest
      • Learn about the Level and Height Balanced Tree

      Lectures

      Class Record :

    • Lesson 22

      Discussion Topics

      • Introduction Spanning Trees on graph
      • Introduction Depth-First Search
      •  Introduction Breadth-First Search and Backtracking

      Learning Outcomes

      • Understand  about  Spanning Trees on graph
      • Learn about constructing Depth-First Search ,Breadth-First Search and Backtracking

      Lectures

      Reference Video: 

       

       

      Class Record :

    • Quiz 3(K section) Assignment
      Opened: Saturday, 29 October 2022, 1:00 PM
      Due: Saturday, 5 November 2022, 2:10 PM


  • Minimum Spanning Trees

    • Lesson 23

      Discussion Topics

      • Introduction Minimum Spanning Trees
      • Introduction Prim’s Algorithm and Kruskal’s Algorithm

      Learning Outcomes

      • Understand  about   Minimum Spanning Trees
      • Learn about constructing Prim’s Algorithm and Kruskal’s Algorithm

      Lectures

      Class Record :

    • Review for Final

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


    • Final Assignment
      Opened: Friday, 4 November 2022, 12:00 AM
      Due: Monday, 7 November 2022, 12:00 AM
    • Quiz 3
      Opened: Thursday, 8 December 2022, 8:40 PM
      Closed: Thursday, 8 December 2022, 9:15 PM
      View

  • Final Exam


    Exact dates will be announced later.

    • Final Exam Assignment
      Opened: Friday, 4 November 2022, 9:00 AM
      Due: Friday, 4 November 2022, 1:00 PM

      As per the examination routine of the department, the mid-exam or final-exam section will be activated on

      your DIU BLC classroom and the following activity will have to performed by you considering the exam

      condition described in section 2.0:

      (1) Download the paper (pdf) and answer script template (doc) from DIU BLC

      (2) Write responses in the answer script template either type or hand written

      (3) Save the answer script template as pdf e.g. CSE134-O1-111-15-1234-mid.pdf .

      (4) Upload the pdf in DIU BLC and if failed, then send in email or telegram in private within the given time.

      (5)Everyone upload the answer script in below link

      Submission Link: https://forms.gle/S843XdnGWCLtVKBz7