Monday (1-3) C
Tuesday (10-11) TA meeting
Wendesday (12-2) F
Thursday (6-8:30) mobile network
TA office:002 56000 23000 swim2swam
Rosen | Goodrich | Week | Description | Hours | ||
Page | Section | Page | Section | |||
|
|
|
| 1 | Introduction (handout) | ½ |
77 | 1.6-1.8 |
|
|
| Review of Discrete Math (Sets and Functions) | 1½ |
|
| 1 | 1.1-1.8 |
| C++ Programming (self-taught) | 0 |
301 | 4.1 |
|
|
| Counting: Product Rule, Sum Rule, Inclusion-Exclusion Principle, Tree Diagrams | 1½ |
313 | 4.2 |
|
| 2 | Pigeonhole Principle | 1 |
320 | 4.3 |
|
|
| Permutations, Combinations | 1½ |
327 | 4.4 |
|
| 3 | Binomial Theorem, Pascal’s Identity | 1 |
335 | 4.5 |
|
|
| Generalized Permutations and Combinations | 1 |
451 | 6.5 |
|
|
| Inclusion-Exclusion, cont. | ½ |
457 | 6.6 |
|
|
| Applications of Inclusion-Exclusion | ½ |
131 | 2.2 | 123 | 3.5 | 4 | Big-O, Big-Omega, Big-Theta | 2 |
144 | 2.3 | 129 | 3.6 |
| Complexity: Time and Space | 1 |
|
|
|
| 5 | Midterm #1 (tentatively) | 1 |
|
| 176 | 4.4 |
| Linked Lists | 1 |
|
| 183 | 4.5 |
| Double-Ended Queues (Queues and Stacks) | 1 |
|
| 504 | 10.3 | 6 | Quick Sort | 1 |
274 | 3.5 | 485 | 10.1 |
| Merge Sort | 1 |
|
| 371 | 8.2 |
| Implementation of Hash Tables | 2 |
631 | 9.1 |
|
| 7 | Introduction to Trees | 1 |
|
| |||||
