Prof. David Nassimi
CS 506, Foundations of Computer Science
(Discrete Mathematics)

Spring 2013
Wed. 6:00-9:05 pm, CKB 223
Office Hours (Mine and TA's)

Syllabus and Class Notes:

• Syllabus (Spring 2013)
• Notes on Divide-and-Conquer Recurrences

Assignments:

• Homework 1: Due Week 3, Wednesday Feb. 6, 2013
  (Topic: Sets)
• Homework 2: Due Week 4, Wednesday Feb. 13
  (Logic)
• Homework 3: Due Week 5, Wednesday Feb. 20
  (Proofs and induction)
• Homework 4: Due Week 7, Wednesday March 6
  (Functions, Relations)
• Programming Assignment 1: Due Week 10, Wed. Apr. 3
  (Towers-of-Hanoi)
• Homework 5: Due Week 11, Wed. April 10
  (Algorithms Analysis)
• Programming Assignment 2: Due Week 12, Wed. April 17
  (Insertion Sort Experimentation)



New Assignments:

• Homework 6: Practice problems
  (Combinatorics)

Announcements:

Previous Exams:

• Spring 2013: || Exam 1 || Exam 1 Solution || Exam 2 || Exam 2 Solution ||
• Spring 2012: || Exam 1 || Exam 1 Solution || Exam 2 || Exam 2 Solution ||
• Spring 2009: || Exam 1 || Exam 2 || Final ||