CS 200  Spring 2013
Mathematical Foundations of Computing
Announcements

Final Exam is
selfscheduled. Take it in Twilight Hall during the final exam week.
You may bring two doublesided 8.5"x11" sheets of notes.
Assignments
 Homework 1, due Tuesday, 2/19.
Solutions.
 Homework 2, due Tuesday, 2/26.
Solutions.
 Homework 3, due Tuesday, 3/5.
Solutions.
 Homework 4, due Tuesday, 3/12.
Solutions.
 Homework 5, due Tuesday, 3/19.
Solutions.
 Homework 6, due Tuesday, 4/2.
Solutions.
 Homework 7, due Thursday, 4/11.
Solutions.
 Homework 8, due Thursday, 4/25.
Solutions.
 Homework 9, due Thursday, 5/2.
Solutions.
 Homework 10, due Thursday, 5/9.
Solutions.
Lectures & Readings
 Tues 2/12  Course introduction, Propositional Logic, Sets and set operations.
MCS 33.1, 44.1.
 Thurs 2/14  Predicate Logic, Proof techniques.
MCS 11.9, 3.23.6.
 Tues 2/19  Valid arguments, practice proof writing.
MCS 11.9, 3.23.6.
 Thurs 2/21  Proofs and
arguments.
MCS 11.9, 3.23.6.
 Tues 2/26  Sequences, Functions, Binary Relations, Finite Cardinality.
MCS 4.24.5.
 Thurs 2/28  Well Ordering Principle.
MCS Chap 2.
 Tues 3/5  State Machines.
MCS 5.4.
 Thurs 3/7  Induction.
MCS 5.15.3.
 Tues 3/12  More Induction.
MCS 5.15.3.
 Thurs 3/14  Recursive Data, Structural Induction.
MCS Chap 6.
 Tues 3/19  Infinite sets.
MCS Chap 7.
 Thurs 3/21  Number theory.
MCS Chap 8.
 Tues 4/2  RSA.
MCS Chap 8.
 Thurs 4/4  Directed graphs.
MCS Chap 9.
 Tues 4/9  Simple graphs.
MCS Chap 11.
 Thurs 4/11  Simple graphs, NPcompleteness.
MCS Chap 11.
 Tues 4/16  Trees and forests.
MCS Chap 11.
 Thurs 4/18  Algorithms on graphs and trees.
MCS Chap 11.
 Tues 4/23  Asymptotic complexity.
MCS Chap 13.7.
 Thurs 4/25  Recurrence Relations.
MCS Chap 21.
 Tues 4/30  Counting.
MCS Chap 14.
 Thurs 5/2  Permutations and combinations.
MCS Chap 14.
 Tues 5/7  Probability.
MCS Chap 16.
 Thurs 5/9  Discrete mathematics in computer science.