Announcements

Syllabus

  • Mon 2/11
  • Wed 2/13
  • Fri 2/15
  • Mon 2/18
  • Wed 2/20
  • Fri 2/22
  • Mon 2/25
  • Wed 2/27
  • Fri 2/29
  • Mon 3/3
  • Wed 3/5
  • Fri 3/7
  • Mon 3/10
  • Wed 3/12
  • Thu 3/13
  • Fri 3/14
  • Mon 3/17
  • Wed 3/19
  • Fri 3/21
  • Mon 3/31
  • Wed 4/2
  • Fri 4/4
  • Mon 4/7
  • Wed 4/9
  • Fri 4/11
  • Mon 4/14
  • Wed 4/16
  • Thu 4/17
  • Fri 4/18
  • Mon 4/21
  • Wed 4/23
  • Fri 4/25
  • Mon 4/28
  • Wed 4/30
  • Fri 5/2
  • Mon 5/5
  • Wed 5/7
  • Fri 5/9
  • Tue 5/13
  • Course Introduction; Propositional Logic. R1.1-1.2.
  • Predicate Logic. R1.3-1.4.
  • Methods of Proof. R1.5-1.7. HW 1 due. (Solns)
  • Sets and Set Operations. R2.1-2.2.
  • Functions; Sequences and Summations. R2.3.2-4. HW 2 due. (Solns)
  • No class (Winter Carnival).
  • Summations; Order of Growth. R2.4, 3.2.
  • Algorithms and Algorithmic Complexity. R3.1, 3.3.
  • Integers and Their Properties. R3.4-3.6. HW 3 due. (Solns)
  • Linear Congruences; Chinese Remainder Theorem. R3.7.
  • Public-Key Cryptography and RSA. R4.1. HW 4 due. (Solns)
  • RSA; Mathematical Induction. R3.7, 4.1.
  • Mathematical Induction; Recursive Definitions and Algorithms. R4.1-4.4.
  • Midterm Review. HW 5 due. (Solns) (Sample MT and Solns.)
  • Midterm 1, 7:00-9:00pm, in MBH 538 (Solns).
  • Pigeonhole Principle; Permutations and Combinations. R5.1-5.3.
  • Binomial Coefficients; Generalized Combinations. R5.4-5.5.
  • Probability Theory. R6.1. HW 6 due. (Solns)
  • Conditional Probability and Bayes' Theorem. R6.2-6.3.
  • — Spring Break —
  • More Probability. R6.2-6.4.
  • Average-Case Complexity; Recurrence Relations. R6.4, 7.1.
  • Divide and Conquer Recurrence Relations. R7.3. HW 7 due. (Solns)
  • Properties and Representations of Relations. R8.1-8.3.
  • n-ary Relations and Closure of Relations. R8.2, 8.4.
  • No class (CCSCNE programming contest). HW 8 due. (Solns)
  • Equivalence Relations. R8.5.
  • Midterm Review. HW 9. (Sample MT 2 and Solns).
  • Midterm 2, 7:00-9:00pm, in MBH 538. (Solns).
  • Graphs: Examples and Terminology. R9.1-9.2.
  • Graph Isomorphism and Connectivity. R9.3-9.4.
  • Euler and Hamiltonian Paths. R9.5.
  • Single-Source Shortest Paths. R9.6. HW 10 due. (Solns)
  • Trees and Their Properties. R10.1-10.3.
  • Tree Traversal; Game Trees. R10.2-10.3.
  • Spanning Trees; Minimum Spanning Trees. R10.4-10.5. HW 11 due. (Solns)
  • Languages and Grammars; Regular Sets. R12.1.
  • Finite State Machines and Automata. R12.2-12.3.
  • Language Recognition; Course Summary. R12.4. HW 12 due. (Solns)
  • Final Exam, 9:00am-12:00noon, in MBH 538