Syllabus Math 213

 

Math 213. Introduction to Discrete Mathematics
Syllabus for Instructors

Text: Kenneth H. Rosen: Discrete Mathematics and Its Applications, McGraw-Hill

3 days - Basic Structures (Ch.2, Sections 2.1-2.3)
3 days - Algorithms (Ch.3, Sections 3.1-3.3)
3 days - Induction (Ch.4, Sections 4.1-4.2)
5 days - Counting (Ch.5, Sections 5.1-5.5)

First Hour Exam

3 days - Discrete Probability (Ch.6, Sections 6.1-6.3)
7 days - Advanced Counting (Ch.7, Sections 7.1-7.2 and 7.5-7.6)
3 days - Relations (Ch.8, Sections 8.1, 8.3, and 8.5)

Second Hour Exam

6 days - Graphs (Ch.9, All)
5 days - Trees (Ch.10, All)

Third Hour Exam

2 days - Review and Leeway

Revised by R. Muncaster, June 25, 2009.