## Schedule

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