People:

TA's: You can find out TA office hours and updates from the Columbia Computer Science TA Page.

• Ariel Elbaz
  Office hours: Wednesday 1 - 3 pm, 516 Computer Science
• Benjamin Chan
  Office hours: Wednesday 11 - 1 pm, Mudd basement TA room

Prerequisite: Any introductory course in computer programming.

Topics Covered: Foundations: logic, sets, sequences, strings, proofs, mathematical induction, recursion. Number theory: Euclidean algorithm, modular arithmetic, Chinese remainder theorem, RSA encryption. Combinatorics: permutations and combinations, elementary finite probability, recurrence relations, inclusion-exclusion principle. Graph theory: isomorphism, planarity, circuits, trees, directed graphs.

Textbook: Kolman, Busby and Ross, Discrete Mathematical Structures, 5th Ed. Pearson (Prentice Hall), 2004, ISBN: 0-13-045797-3. Available at Labyrinth books (112^th between Broadway and Amsterdam).

Important Dates:

• Bi-Weekly homework assignments (consult schedule).
• Quiz 1 in class:
  • Tuesday 2/24
• Midterm Exam in class:
  • Tuesday, 3/11
• Spring Break (no class on 3/16 and 3/18)
• Quiz 2 in class:
  • Thursday 4/15
• Final exam:
  Time and Location to be announced

Course Contract: Each student is required to read this contract as it contains important information about the course policy, expectations from students, special cicumumstances, etc.