Course Notes

Notes are in Microsoft Powerpoint format. They can be read on any of the Windows computers in the UCF labs, or, if you're on another computer and don't have Powerpoint, you can get a free viewer from Microsoft.

Algorithm Analysis Techniques - 15 pages (1/11/2001)
The List, Stack, and Queue ADTs - 17 pages (1/25/2001)
Trees - 23 pages (2/20/2001)
Heaps - 17 pages (2/22/2001)
Sorting, Divide-and-Conquer Techniques - 18 pages (3/08/2001)
Greedy Algorithms - 29 pages (3/27/2001)
Dynamic Programming - 17 pages (4/19/2001)