Description:

Focuses on the design and efficiency of algorithms. Covers the basic algorithm paradigms including graph traversals, greedy algorithms, divide and conquer, dynamic programming and flow algorithms. Introduces complexity theory, NP-completeness and polynomial-time reductions. Additional topics may include approximation algorithms, randomized algorithms and linear programming.

Instructor: Harold Connamacher

• e-mail: hsc
• Office: Palenske 220
• Office hours: Monday, Tuesday, Friday at 11am, or anytime my door is open
• Office Phone: 629-0363

Timetable:

• Lecture: Monday, Tuesday, Thursday, Friday, 2pm in Palenske 221

Course Textbooks:

• Tardos and Kleinberg, Algorithm Desigh, Addison Wesley, 2006. ISBN 0321295358

Prerequisites:

• Math 239: Discrete Structures
• CS 171: Introduction to Computer Science I