This course provides an introduction to the mathematical structures of computer science. Discrete mathematics includes topics on set theory, logic, proofs, relations, functions, orders of growth, induction, recursion, and graphs.
This course is recommended background for: CS2223, CS3133, CS3431, ECE3801 and most of upper-level mathematics.
There will be a quiz each Friday.
Your homework altogether will count for one quiz.
The quizzes altogether count for 60% of your grade.
There will one final exam, worth 40% of your grade.
Mondays - Quizes are returned.
Tuesday - Two homework problems are collected.
Wednesday - Conferences. (gmarceau will present problems - particularly those problems you have emailed.)
Thursday - Collected homework is returned.
Friday - Quiz. Homework sections to be prepared for Tuesday are announced.
Chapter 1: Section 1 - 1, 2, 11, 13 Section 2 - 2, 3, 6, 9, 10, 11c Section 3 - 1, 3, 5 Section 4 - 1f, 3, 6, 7, 10 Section 5 - 1, 2, 3, 6 Section 6 - 1, 4 Section 7 - 1, 6, 8, 10 Section 8 - 1, 3, 6, 13 Section 9 - 1, 2, 4, 8, 16, 10, 18, 20 Section 10 - 1, 2, 3, 7, 8 Chapter 2: Section 1 - 1, 5, 6 Section 2 - 1b, 1c, 4 Section 3 - 1, 3, 10, 12, 14 Section 4 - 1, 2, 3, 4, 8, 12, 13, 15 Section 5 - 4, 6 Section 6 - 2, 5, 16, 17, 19 Section 7 - 1, 2, 11 Section 8 - 1, 2, 3, 9 Section 9 - 2, 3, 4, 5 Section 10 - 1, 5 Chapter 3: Section 1 - 1, 2, 5, 6 Section 2 - 4, 5, 8, 13 Section 3 - 1, 2, 4, 10, 17, 24 Section 4 - 1, 4, 7, 10 Section 6 - 1, 2, 4, 6, 7, Chapter 5: Section 1 - 3, Section 2 - 2, 4, 5, 6, 8, 10a, 10d, 11c, 12, 13, 14 Section 3 - 1, 2, 3, 6, 7, 10 Section 4 - 1, 2, 5, 7