Computer Science 477/677: Design and Analysis of Algorithms
Fall 1998
Course Outline

-
Asymptotic Complexity (big "O") and that sort of thing.
-
Overview of Data Structures (largely a review of material from CSC 269).
-
Recurrence relations.
-
Greedy Algorithms.
-
Divide and Conquer Algorithms.
-
Summary of Sorting Algorithms.
-
Dynamic Programming.
-
Correctness of Algorithms.
-
Advanced Algorithms.
-
NP-complete problems.
