CS 200 - Spring 2013

Mathematical Foundations of Computing

Announcements

Final Exam is self-scheduled. Take it in Twilight Hall during the final exam week. You may bring two double-sided 8.5"x11" sheets of notes.

Assignments

  1. Homework 1, due Tuesday, 2/19. Solutions.
  2. Homework 2, due Tuesday, 2/26. Solutions.
  3. Homework 3, due Tuesday, 3/5. Solutions.
  4. Homework 4, due Tuesday, 3/12. Solutions.
  5. Homework 5, due Tuesday, 3/19. Solutions.
  6. Homework 6, due Tuesday, 4/2. Solutions.
  7. Homework 7, due Thursday, 4/11. Solutions.
  8. Homework 8, due Thursday, 4/25. Solutions.
  9. Homework 9, due Thursday, 5/2. Solutions.
  10. Homework 10, due Thursday, 5/9. Solutions.

Lectures & Readings

  1. Tues 2/12 - Course introduction, Propositional Logic, Sets and set operations. MCS 3-3.1, 4-4.1.
  2. Thurs 2/14 - Predicate Logic, Proof techniques. MCS 1-1.9, 3.2-3.6.
  3. Tues 2/19 - Valid arguments, practice proof writing. MCS 1-1.9, 3.2-3.6.
  4. Thurs 2/21 - Proofs and arguments. MCS 1-1.9, 3.2-3.6.
  5. Tues 2/26 - Sequences, Functions, Binary Relations, Finite Cardinality. MCS 4.2-4.5.
  6. Thurs 2/28 - Well Ordering Principle. MCS Chap 2.
  7. Tues 3/5 - State Machines. MCS 5.4.
  8. Thurs 3/7 - Induction. MCS 5.1-5.3.
  9. Tues 3/12 - More Induction. MCS 5.1-5.3.
  10. Thurs 3/14 - Recursive Data, Structural Induction. MCS Chap 6.
  11. Tues 3/19 - Infinite sets. MCS Chap 7.
  12. Thurs 3/21 - Number theory. MCS Chap 8.
  13. Tues 4/2 - RSA. MCS Chap 8.
  14. Thurs 4/4 - Directed graphs. MCS Chap 9.
  15. Tues 4/9 - Simple graphs. MCS Chap 11.
  16. Thurs 4/11 - Simple graphs, NP-completeness. MCS Chap 11.
  17. Tues 4/16 - Trees and forests. MCS Chap 11.
  18. Thurs 4/18 - Algorithms on graphs and trees. MCS Chap 11.
  19. Tues 4/23 - Asymptotic complexity. MCS Chap 13.7.
  20. Thurs 4/25 - Recurrence Relations. MCS Chap 21.
  21. Tues 4/30 - Counting. MCS Chap 14.
  22. Thurs 5/2 - Permutations and combinations. MCS Chap 14.
  23. Tues 5/7 - Probability. MCS Chap 16.
  24. Thurs 5/9 - Discrete mathematics in computer science.