CS 577 - Introduction to Algorithms Fall 2014 - 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, and reductions. 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: M 4-5pm and F 2-4pm in CS&S 4390
  

• Teaching Assistant: Rex Fernando
  Email: rex@cs.wisc.edu
  Office hours: M 10-11am and T 2-4pm in CS&S 1308
  

• Teaching Assistant: Kevin Kowalski
  Email: nargle@cs.wisc.edu
  Office hours: M 1-2pm and T 4-6pm in CS&S 7331
  

Lectures

MW 2:30-3:45pm in Noland 168

Review Sessions

M 7:15-9:15pm in CS&S 1325

More info

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