|
Day
|
Topic
|
Reading
|
| Tue Aug 27 |
Introduction and Set Theory |
1.4, 1.5 |
| Thu Aug 29 |
Propositional Logic, Set Identities |
1.1, 1.2, 1.5 |
|
| Tue Sep 3 |
Functions, Arithmetic Series |
1.6, 1.7 |
| Thu Sep 5 |
Geometric Series, Harmonic Series, Review Problems |
1.7 |
|
| Tue Sep 10 |
Proof Techniques |
3.1 |
| Thu Sep 12 |
Proof Techniques: Proof by Induction |
3.2 |
| Tue Sep 17 |
More induction, Recursive Definitions |
3.2, 3.3 |
| Thu Sep 19 |
Recursion, Basics of Counting |
3.4, 4.1 |
| Tue Sep 24 |
Pigeon Hole Principle, Permutations and Combinations |
4.2, 4.3 |
| Thu Sep 26 |
Exam 1 (in class) |
All material covered till (and including) Tue, Sep 17 |
| Tue Oct 1 |
Permutations versus Combinations |
4.3 |
| Thu Oct 3 |
Permutations, Combinations with Repetitions, Pascal's Triangle |
4.3 |
| Tue Oct 8 |
Binomial Theorem, Probability |
4.4 |
| Thu Oct 10 |
Probability, direct applications of definition, union rule |
4.4 |
| Tue Oct 15 |
Independent Events, Conditional Probability |
4.5 (till, but not including Bernoulli trials) |
| Thu Oct 17 |
Independence of Events (continued) |
4.5 |
| Thu Oct 22 |
Random Variables, Expectation |
4.5 |
| Thu Oct 24 |
Binomial and Geometric Random Variables |
4.5 (does not cover the geometric random variable) |
| Tue Oct 29 |
Introduction to Graphs |
7.1 |
| Thu Oct 31 |
Euler Circuits, Bridges of Konigsberg |
7.5 (only the Euler circuit portion) |
| Tue Nov 5 |
Special Types of Graphs - bipartite graphs, complete graphs, star, tree |
7.2 |
| Thu Nov 7 |
Exam 2 (in class) |
Counting and Probability |
| Tue Nov 12 |
Introduction to Trees |
8.1 |
| Thu Nov 14 |
Properties of Trees, Proof by Induction on Trees, Binary Search Trees |
8.1, 8.2 (excluding prefix codes) |
| Tue Nov 19 |
More Searching - Hashing |
|
| Thu Nov 21 |
Graph Representation (Adjacency Matrix, Adjacency List), Depth First Search Algorithm and its Complexity |
7.3, 8.5 (page 572 onwards) |
| Tue Dec 26 |
Thanksgiving Break |
|
| Thu Dec 28 |
Thanksgiving Break |
|
| Tue Dec 3 |
Breadth First Search, Spanning Trees, Tree Traversals (preorder, postorder, inorder) |
8.5 (spanning trees), 8.3 (tree traversal) |
| Thu Dec 5 |
Bipartite graphs, Proof that K(3,3) does not have a non-crossing drawing, Hamilton paths |
7.2 (bipartite graphs), 7.7 (planar graphs) |
| Tue Dec 10 |
Review of Graphs, Applications of Algorithms |
|
| Mon Dec 16, 3.30-5.00pm |
Review Session in Curtiss 15 |
|
| Thu Dec 19, 8.00-9.15 |
Exam 3 (in class) |
|