Schedule
- Jan 18 Sets (Chapter 2.1)
- Jan 20 Sets operations
- Jan 23 Functions
- Jan 25 Functions and Algorithm
- Jan 27 Algorithms Quiz 1
- Jan 30 Halting problem
- Feb 1 big-O notation HW1 is due
- Feb 3 theta and omega notationQuiz 2
- Feb 6 induction
- Feb 8 induction HW2 is due
- Feb 10 strong induction Quiz 3
- Feb 13 easy computing
- Feb 15 test review HW3 is due
- Feb 17 MIDTERM up to strong induction
- Feb 20 basic counting principles
- Feb 22 pigeonhole principle
- Feb 24 permutations Quiz 4
- Feb 27 combinations and binomial theorem
- Feb 29 binomial identities and Pascal's triangle HW4 is due
- Mar 2 Generalized permutations and combinations Quiz 5
- Mar 5 Permutations with indistiguishable objects
- Mar 7 (in)distinguishable objects and boxes. Start of probability HW5 is due
- Mar 9 probability distribution and conditional probability Quiz 6
- Mar 12 independence
- Mar 14 test review HW6 is due
- Mar 16 MIDTERM
- Mar 26 Baye's theorem
- Mar 28 homogeneous recurrence relationsno HW due
- Mar 30 principle of inclusion and exclusion
- Apr 2 principle of inclusion and exclusion
- Apr 4 graph theory - intro HW 7 is due
- Apr 6 graph theory - basic notions
- Apr 9 Hall's theorem
- Apr 11 graph isomorphism HW 8 is due
- Apr 13 connectivity
- Apr 16 Euler's cycle
- Apr 18 Hamilton's circuit HW 9 is due
- Apr 20 Shortest path (Dijkstra's algorithm)
- Apr 23 planar graphs
- Apr 25 test review HW 10 is due
- Apr 27 MIDTERM
- Apr 30 graph coloring, Dijkstra algorithm
- May 2 Minimum spannig tree
- May 7 MONDAY 8:00 - 11:00 The super big exam