| Date | Lecture Notes | Topic | Note |
| 2/3/2003 | Lecture 1 - PPT, PDF | Introduction to C++ and Algorithm Analysis | |
| 2/17/2003 | Lecture 2 - PPT, PDF | Trees: binary trees; binary search trees (BST); AVL trees; | |
| 3/1/2003 | Lecture 3 - PPT, PDF | Splay trees. | |
| 3/10/2003 | Lecture 4 - PPT, PDF | Dissection of AVL tree operations | |
| 3/10/2003 | Lecture 5 - PPT, PDF | Hashing | |
| 3/17/2003 | Lecture 6 - PPT, PDF | Hashing continued | |
| 3/24/2003 | Lecture 7 - PPT, PDF | Priority Queues - 1 (Heaps) | |
| 4/7//2003 | Lecture 8 - PPT, PDF | Priority Queues - 2 (Heaps) | |
| 4/9/2003 | Lecture 9 - PPT, PDF | Sorting | |
| 4/16/2003 | Lecture 10 - PPT, PDF | Sorting - 2 | |
| 4/21/2003 | Lecture 11 - PPT, PDF | Sorting - 3 | |
| 4/28/2003 | Lecture 12 - PPT, PDF | Graph Algorithms - Definitions and Topological Sort | |
| 4/28/2003 | Lecture 13 - PPT, PDF | Graph Algorithms - Shortest Path Problem | |
| 5/12/2003 | Lecture 14 - PPT, PDF | Graph Algorithms - Finding Minimum Spanning Trees | |
© Copyright notice: Please note that all the lecture notes here are copyrighted. They are free to use without any permission in Bilkent University, but use of them out of Bilkent University requires the explicit permission of the instructor.