CS 30: Discrete Mathematics in Computer Science
Fall 2014 | 2 hour (MWF 13:45-14:55, x-hr Th 13:00-13:50) | LSC 100

This page will be updated frequently with current and upcoming topics.

References to the recommended textbooks are made as follows: [LLM] is the Lehman-Leighton-Meyer book, and [Ros] is the Rosen book. Thus, for example, the notation [LLM:4.1,4.2] means "sections 4.1 and 4.2 of the Lehman-Leighton-Meyer book."

DateTopicsReferencesDue
Sep 15Course introduction; Three highlights of Discrete MathematicsSlides
Sep 17Pancakes with a problemSlides
Sep 18 xQuiz 0
Sep 19Sets and operations on setsSlides; [LLM:4.1,4.2] [Ros:2.1,2.2]
Sep 22Relations and functionsSlides; [LLM:4.3,4.4,4.5] [Ros:2.3]
Sep 24Quiz 0 discussion; Functions; Logic & logical notationSlides; [LLM:3.1,3.2,3.3] [Ros: 1.1,1.2,1.3]
Sep 25 x(not used)HW1
Sep 26Logic: variables and quantifiersSlides; [LLM:3.4,3.6] [Ros: 1.4,1.5]
Sep 29Counting: disjoint union, arithmetic seriesNotes; [Ros: 6.1]
Oct 1Counting: product rule; mathematical inductionNotes; [LLM: 14.1,14.2,5.1] [Ros: 6.1,5.1]
Oct 2 x(not used)HW2
Oct 3Induction revisited; permutationsNotes; [LLM: 14.3,5.1] [Ros:6.1,5.1]
Oct 6Division rule; counting subsetsNotes; [LLM: 14.4,14.5] [Ros:6.3]
Oct 8Binomial coefficients; bijective proofsNotes; [LLM:14.6.3,14.10] [Ros:6.4]
Oct 9 xMidterm 1 (18:00-21:00)
Oct 10The inclusion-exclusion principleNotes; [LLM:14.9] [Ros:8.5]HW3
Oct 13Probability; sample spaces, eventsNotes; [LLM:16.1,16.2,16.3] [Ros:7.1]
Oct 15Probability: disjoint sum, inclusion-exclusionNotes; [LLM:16.5] [Ros:7.1]
Oct 16 xMidterm 1 discussionHW4
Oct 17(no class; homecoming)
Oct 20Conditional probability; four-step methodNotes; [LLM 17.1--17.4] [Ros:???]
Oct 22Bayes's Theorem; independenceNotes; [LLM:17.5--17.8] [Ros:???]
Oct 23 xRandom variables; expectationNotes; [LLM:18.1,18.2] [Ros:???]HW5
Oct 24Linearity of expectationNotes; [LLM:18.4,18.5] [Ros:???]
Oct 27Independent variables; VarianceNotes; [LLM:18.2,19.3,19.4] [Ros:???]
Oct 29Graphs, digraphs, degrees, handshake lemma; Pigeonhole principleNotes;
Oct 30 x(not used)HW6
Oct 31Walks and paths; Connectivity; Equivalence relationsNotes;
Nov 3Trees and the Tree TheoremNotes
Nov 5More on treesNotes
Nov 6 xMidterm 2 (18:00-21:00)
Nov 7Bipartite graphsNotesHW7
Nov 10Directed graphs and partial ordersNotes
Nov 12Matchings and marriagesNotes
Nov 13 x(not used)
Nov 14Planarity and coloring; Euler's theoremSlides & NotesHW8
Nov 17The five-color theoremNotes