How to Use the Notes

The notes are stored 6-slides-per-page in Adobe PDF Format. You need to have a PDF reader installed to view them. If, for some strange reason you don't, you can download it using the link on the Resources page

Lecture Notes

If you are using Google Chrome, you may have to click Refresh a few times to see the notes. Chrome's use of it's cache is rather buggy.

Part	Topic	Lecture Notes
1	Algorithm Analysis	PDF File
2	Linked List Data Structure	PDF File
3	Stacks & Queues	PDF File
4	Recursion	PDF File
5	Binary Search & Basic Sorting	PDF File
6	Recursive Sorting	PDF File
7	Non-Comparative Sorting	PDF File
8	Trees	PDF File
9	Heaps & Priority Queues	PDF File
10	Binary Search Trees	PDF File
11	Balanced Trees	PDF File
12	Set Data Structures	PDF File
13	Hashing	PDF File
14	Graphs	PDF File
15	Minimum Spanning Trees	PDF File
16	Shortest Path	PDF File
17	State Machines	PDF File
	Final Study Guide	PDF File