CS557 Algorithms
| Course Description( 3 credits ) The analysis of algorithms through the main algorithm design paradigms. Asymptotic notation; Sums and recurrences; Divide and Conquer; Dynamic Programming; Greedy Algorithms; Graph Algorithms; Computational Geometry; Advanced Data Structures; NP Completeness. Prerequisites : MA310 Discrete Mathematics, CS250 Data Structures and Abstraction, or CS315 Introduction to Algorithms Previously Taught : |