Introduction to Discrete Mathematics syllabus

Our textbook is "Discrete Mathematics and its applications" (4-th Edition), by Kenneth Rosen
 
 
 

1. Foundations. Highlights of Sections 1.4-1.8 (some of this material may be revisited later) [4 Lectures]
2. Mathematical Induction. Section 3.2 [2 Lectures]
3. Counting. Sections 4.1-4.4 and 4.6  [6 Lectures]
4. First  Hour Exam [1 Lecture]
5. Recurrences and Inclusion-Exclusion. Sections 5.1-5.3 and 5.5-5.6 [9 Lectures]
6. Relations, with an emphasis on equivalence relations. Sections 6.1, 6.3 and 6.5 [4 Lectures]
7. Graphs. All of Chapter 7 (Sections 7.1-7.6 the first week and 7.7-7.8 the second week). Graphs and multigraphs, isomorphism, Euler walks and paths, Hamiltonians, algorithms, planar graphs, easy coloring. [6 Lectures]
8. Trees. All of Chapter 8. Rooted trees, traversals, binary trees, minimal spanning trees, sorting algorithms. Some proofs will be included. [6 Lectures] 
9. Third hour exam [1 Lecture]
10. Leeway (review, catch-up, extra material) [3 lectures]

   
 

Slight deviations from this syllabus are possible during the course.

Back to Ilya Kapovich's homepage