| No. | Topic | Lecture Notes | Reading |
|---|---|---|---|
| INTRODUCTION & REVIEW | |||
| 1 | Course Outline & Introduction | lec01.pdf | Lecture Notes |
| 2 | Review of Relations and Propositions | lec02.pdf | Lecture Notes |
| 3 | Review of Chains and Functions | lec03.pdf | Lecture Notes |
| GRAPHS AND ALGORITHMS | |||
| 4 | Intro to Graphs | lec04.pdf | Ch. 1 |
| 5 | Theory and Algorithms for Graph Traversal | lec05.pdf | Ch. 2 |
| 6 | Theory and Algorithms for Graph Traversal II | lec06.pdf | Ch. 3 |
| 7 | Theory and Algorithms for Trees | lec07.pdf | Ch. 4 |
| 8 | Theory and Algorithms for Trees II | lec08.pdf | Ch. 5 |
| 9 | Theory and Algorithms for Graph Connectivity | lec09.pdf | Ch. 6 |
| 10 | Theory and Algorithms for Matching | lec10.pdf | Ch. 7 |
| 11 | Theory and Algorithms for Network Flows | lec11.pdf | Ch. 8 |
| 12 | Theory and Algorithms for Graph Traversal III | lec12.pdf | Ch. 9 |
| 13 | Theory and Algorithms for Digraphs and Coloring | lec13.pdf | Ch. 10 + 11 |
| GRAPH ALGORITHMS IN ACTION | |||
| 14 | Strings | lec14.pdf | Lecture Notes |
| 15 | Satisfiability and Learning | lec15.pdf | Ch. 10.6, 9.5, Lecture Notes |
| 16 | Boolean Functions and Problems | lec16.pdf | Lecture Notes |
| 17 | Finite Automata | lec17.pdf | Lecture Notes |
| 18 | Finite Automata II | lec18.pdf | Lecture Notes |
| OTHER TOPICS | |||
| 19 | Analysis of Algorithms | lec19.pdf | Lecture Notes |
| 20 | Optimization and Integer Problems | lec20.pdf | Ch. 14 |
| 21 | Finite Automata III | lec21.pdf | Lecture Notes |
| 22 | Queuing Theory Foundations | lec22.pdf | Lecture Notes |
| 23 | Project Presentations |