1. 15. Jan. 2002, Syllabus & Introduction

2. 17. Jan. 2002, Correctness, analysis, design [Printable]

3. 22. Jan. 2002, Growth rate of functions [Printable]

4. 24. Jan. 2002, Recurrences [Printable]

5. 29. Jan. 2002, Heaps, Heapsort [Printable]

6. 31. Jan. 2002, Quicksort [Printable]

7. 27. Sept. 2002, Interdisciplinary Lecture

8. 07. Feb. 2002, Linear Time Sorting [Printable] [PDF]

9. 12. Feb. 2002, Data Stuctures Review [Printable] [PDF]

10. 14. Feb. 2002, Hash Tables [Printable] [PDF]

11. 19. Feb. 2002, Mid-Term Review [Printable] [PDF]

12. 21. Feb. 2002, Mid-Term Exam I

13. 26. Feb. 2002, Binary Search Trees [Printable]

14. 28. Feb. 2002, Balanced trees, Red-Black Trees [Printable] [PDF]

15. 05. Mar. 2002, B-Trees [Printable] [PDF]

16. 07. Mar. 2002, Augmenting Data Structures [Printable] [PDF]

17. 12. Mar. 2002, Dynamic Programming [Printable] [PDF]

18. 14. Mar. 2002, Greedy Algorithms [Printable] [PDF]

19. 19. Mar. 2002, Review [Printable]

20. 21. Mar. 2002, Graph Introduction [Printable]

21. 26. Mar. 2002, Spring Break

22. 28. Mar. 2002, Spring Break

23. 02. Apr. 2002, Elementary Graph Algorithms [Printable]

24. 04. Apr. 2002, Minimum Spanning Trees [Printable]

25. 09. Apr. 2002, Single-Source Shortest Paths [Printable]

26. 09. Apr. 2002, Single-Source Shortest Paths [Printable]

27. 16. Apr. 2002, String Matching [Printable]

28. 18. Apr. 2002, KMP Algorithm [Printable]

29. 23. Apr. 2002, RSA public-key cryptosystem [Printable]

30. 25. Apr. 2002, NP-Completeness, Polynomial reducibility [Printable]

31. 30. Apr. 2002, Course Review [Printable]