CSE 521

Design and Analysis of Algorithms I

Credits
4.0
Lead Instructor
Theory Faculty
Textbook
Algorithm Design by Jon Kleinberg and Eva Tardos. Addison Wesley, 2006.
Course Description
Principles of design of efficient algorithms: recursion, divide and conquer, balancing, dynamic programming, greedy method, network flow, linear programming. Correctness and analysis of algorithms. NP-completeness.
Prerequisites
CSE major and CSE 326 or equivalent. CSE majors only.
CE Major Status
None
Course Objectives
Comprehension of the basic principles of design of efficient algorithms: recursion, divide and conquer, balancing, dynamic programming, greedy method, network flow, linear programming. Correctness and analysis of algorithms. NP-completeness.
ABET Outcomes
No outcomes registered
Course Topics