CS 577 - Introduction to Algorithms Fall 2013 - Section 2

Course Description

This course provides an undergraduate-level introduction to the design and analysis of algorithms. The main focus lies on techniques for constructing correct efficient algorithms and on tools to reason about them. Design paradigms include greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness. A second focus point is computational intractability. NP-complete problems are covered, as well as ways to deal with them.

The course forms a foundation for all areas of computer science. The particular computational problems discussed have applications in artificial intelligence, computational biology, compiler construction, hardware and network protocols, and optimization.

Text

Jon Kleinberg and Eva Tardos, Algorithm Design, Addison-Wesley, 2006.

Prerequisites

CS 240 (Discrete Mathematics) and CS 367 (Data Structures).

Staff

• Instructor: Dieter van Melkebeek
  Email: dieter@cs.wisc.edu
  Office hours: MT 4:00-5:30pm in 4390 CS&S.
  

• Teaching Assistant: Xi Wu
  Email: xiwu@cs.wisc.edu
  Office hours: MT 5:30-7:00pm in 1301 CS&S.

Lectures

MW 2:30-3:45pm in CS&S 1221.

More info

• Moodle: lecture schedule, assignments, other course materials, and grades.
• Piazza: on-line discussions.
• Wendt Library: reserve materials.