| HW14 Solution | (05/11) | |||
| FIN-Practise Solutions |
(05/07) | |||
| | | ||||
| FIN-Practise | (05/03) | |||
| HW13 Solution | (05/01) | |||
| Handout #38 | (04/30) | Logic Gates | ||
| | | ||||
| Handout #37 | (04/27) | Boolean Functions | ||
| Handout #36 | (04/25) | Trees and Sorting | ||
| Handout #35 | (04/23) | Tree Traversal | ||
| | | ||||
| Handout #34 | (04/20) | Trees | ||
| HW11 Solution | (04/20) | |||
| Handout #33 | (04/18) | Planar Graphs, Coloring | ||
| Handout #32 | (04/16) | Shortest Paths | ||
| | | ||||
| P2 Solutions | (04/15) | |||
| P2 |
(04/15) | |||
| HW10 Solution | (04/14) | |||
| Handout #31 | (04/13) | Connectivity, Euler & Hamilton Paths | ||
| Handout #30 | (04/11) | Graph Isomorphism | ||
| | | ||||
| Handout #29 | (04/06) | Graphs | ||
| HW9 Solutions | (04/05) | |||
| HW8 Solutions | (04/05) | |||
| P2-Practise Solutions |
(04/04) | |||
| Handout #28 | (04/04) | Partial Orderings | ||
| P2-Practise | (04/02) | |||
| Handout #27 | (04/02) | Transitive Closure and Equivalence | ||
| | | ||||
| Handout #26 | (03/30) | Properties of Relations (updated) | ||
| Handout #25 | (03/28) | Inclusion-Exclusion | ||
| Handout #24 | (03/26) | Recurrence Relations | ||
| | | ||||
| Handout #23 | (03/16) | Generating Permutations and Combinations | ||
| Handout #22 | (03/14) | Generalized Permutations and Combinations | ||
| Handout #21 | (03/12) | Probability Theory II | ||
| HW7 Solutions | (03/12) | |||
| | | ||||
| Handout #20 | (03/09) | Probability Theory I | ||
| HW6 Solutions | (03/08) | |||
| Handout #19 | (03/07) | Discrete Probability | ||
| P1 Solutions | (03/07) | |||
| P1 |
(03/06) | |||
| P1 Review | (03/05) | (in-class review session) | ||
| | | ||||
| Handout #18 | (03/02) | Permutations and Combinations (updated) | ||
| HW5 Solutions | (03/01) | |||
| P1-Practise Solutions |
(03/01) | |||
| Handout #17 | (02/28) | Counting, Pigeonhole Principle | ||
| Handout #16 | (02/26) | Program Correctness | ||
| | | ||||
| P1-Practise | (02/25) | |||
| Handout #15 | (02/23) | Recursive Algorithms | ||
| HW4 Solutions | (02/21) | |||
| Handout #14 | (02/21) | Recursive Definitions | ||
| Handout #13 | (02/19) | Induction | ||
| | | ||||
| Handout #12 | (02/16) | Proofs | ||
| Handout #11 | (02/14) | Matrices | ||
| HW3 Solutions | (02/13) | |||
| Handout #10 | (02/12) | Arithmetic in CS | ||
| | | ||||
| Handout #9 | (02/09) | Different Bases | ||
| Handout #8 | (02/07) | Division of Integers | ||
| HW2 Solutions | (02/05) | |||
| Handout #7 | (02/05) | Algorithms and Complexity | ||
| | | ||||
| Handout #6 | (02/02) | Comparing Functions | ||
| Handout #5 | (01/31) | Sequences | ||
| HW1 Solutions | (01/29) | |||
| Handout #4 | (01/29) | Functions | ||
| | | ||||
| Handout #3 | (01/26) | Sets and Set Operations | ||
| Handout #2 | (01/24) | Predicates and Quantifiers | ||
| Handout #1 | (01/22) | Propositional Logic | ||
| Syllabus | (01/22) | |||
Note: the titles above were taken from this year's syllabus, whereas the titles in the index of the lecture slides from Fall 1999 were taken from the FA99 slides themselves. Consequently, the two sets of titles do not coincide perfectly. [This is especially true of the probability-related topics; e.g., the "Probability Theory I" handout corresponds to the "Probability II" lecture slides.]
Adobe's free Acrobat Reader allows you to view and print .pdf files.
Alladin's GSView is another free package that can be used to read and convert .pdf files.
Looking for lecture slides? The complete collection of CS280 Fall 1999's slides (all thirty-seven lectures) can be found here.