MA2410 Discrete Structures

Text: Richard Johnsonbaugh, Discrete Mathematics, Eighth Edition, Pearson, ISBN: 9780321964687

Concept Maps: 

Chapter 1 set and logic                

Chapter 2 proofs                          

Chapter 3 functions, sequences, relations                    

Chapter 6 counting methods                      

Chapter 8 graph theory                        

Chapter 9 trees                         

Chapter 11 Boolean algebra and combinatorial circuits 

Class notes: 

       Lecture Videos    YouTube Playlist  

Link to all blank notes as Word documents

  Week 1  

      Algebra formula sheet,    Trig formula sheet,    Trig graph,  

    1.1 Sets    1.2 Propositions, 1.3 Conditional Propositions and Logical Equivalence

   1.1 Part A     Part B       1.1-1.3 Notes with answers

   1.2

   1.3

  Week 2

    1.4 Arguments and Rules of inference    1.5 Quantifiers, 1.6 Nested Quantifiers

   1.4                                1.4-1.6 Notes with answers

   1.5 Part A     Part B

   1.6

  Week 3

     2.1 Mathematical systems, direct proofs, and counterexamples      

    2.1                        2.1-2.2 Notes with answers

    2.2 Part A     Part B

 Week 4

     2.3 Resolution Proofs, 2.4 Mathematical Induction

    chapter 1-2 exercise

    2.3                         2.3-2.4 Notes with answers

    2.4                         ch1-2 ex solution

  Week 5

     3.1 Functions   3.2 Sequences and Strings

    3.3 Relations

    3.1                         3.1-3.2 Notes with answers

    3.2

    3.3                         3.3-3.5 Notes with answers

  Week 6

     3.4 Equivalence Relations, 3.5 Matrices of Relations

    3.4                         3.3-3.5 Notes with answers

    3.5

  Week 7

     6.1 Basic Principles, 6.2 Permutations and Combinations

    6.3 Generalized Permutations and Combinations

    6.1                         6.1-6.3 Notes with answers

    6.2 Part A    Part B

    6.3

  Week 8

     7.1 Introduction to Recurrence Relations     7.2 Solving Recurrence Relations

    7.1                           7.1-7.2 Notes with answers

    7.2 Part A    Part B     Part C

  Week 9

     8.1 Introduction to Graph Theory         8.2Paths and Cycles    

   8.1 Part A     Part B       8.1-8.3 Notes with answers

   8.2 

  Week 10

     8.3 Hamiltonian Cycles and the Traveling Salesperson

   8.3 Part A     Part B    Part C

   8.1-8.3 Notes with answers

  Week 11

     8.4 A Shortest-Path Algorithm    8.5 Representations of Graphs

   8.4 Part A    Part B         8.4-8.5 Notes with answers

   8.5

  Week 12

     9.1-9.2 Introduction, Terminology and Characterizations of Trees    

    9.3 Spanning Trees

   9.1                            9.1-9.5 Notes with answers

   9.2

   9.3

  Week 13

     9.4 Minimal SpanningTrees, 9.5 Binary Trees

    11.1Combinatorial Circuits

   9.4                                9.1-9.5 Notes with answers

   9.5

   11.1

  Week 14

     11.2Properties of Combinatorial Circuits

   11.2                           11.1-11.4 Notes with answers

  Week 15

     Thanksgiving Break

   Week 16

     11.3-11.4 Boolean Algebras and Synthesis of Circuits

   11.3                           11.1-11.4 Notes with answers

   11.4

Supplement: Chapter 12, section 12.1-12.3   (not in the final exam)

Practice exams and solutions:         Exam scores

1.  Practice Exam 1       Solution             chapter 1-2 exercise        ch1-2 ex solution         Extra practice on sets    Set solution

2.  Practice Exam 2         Solution                      Ch3 - 7 more exercises         Ch3-7 ex solution

3.  Practice Exam 3         Solution        Ch8 more exercises       Ch 8 more ex solution          Ch9 more exercises      ch9 more ex solution   

4. Practice final exam         Solution                   Ch11 more exercises              ch11 more exercises solution

Acknowledgment: The examples in the worksheets are taken from your textbook.  If you find some useful online resources which may be beneficial to the whole class, please let me know. Thank you!!! :-)