CMSC-203 Discrete Math Lectures (spring 2001--Section 0101, Alan Sherman)

These lecture descriptions are recommended by the course coordinator Dr. Alan T. Sherman as a frame of reference for common minimum standards across all sections of CMSC-203.

Lectures: CMSC-203 Discrete Math (Spring 2001)

Alan T. Sherman

30 lectures + final exam (Mon/Wed 2:00-3:30pm in SS 209, Jan 29-May 16). (*) denotes primary example of lecture. Most effective ways to learn through lectures are (1) to ask thoughtful questions based on home problem-solving, and (2) to thoroughly master primary example to extent that student can reproduce (and preferably also adapt, modify, and extend) complete example in technical detail without referring to any notes. Each class begins with student questions and, if requested, discussion of current homework and readings. Readings from text follow lecture topics.

Course is organized in three major parts as follows:
Proofs: 10 lectures (including 5 on induction), including proving correctness of programs
Calculation: 9 lectures, including calculating running times of iterative and recursive programs
Counting: 8 lectures, including counting number of objects (functions, data structures)
Tests: 3 + final exam