Course information
- Description:
Introduction to the design and analysis
of efficient algorithms. Topics include models of computation,
efficient sorting and searching, algorithms for algebraic problems,
graph algorithms, dynamic programming, probabilistic methods,
approximation algorithms, and NP-completeness.
- Credits: 3.0
- Prerequisites: COMS W3139 and W3203.
- For: Undergraduate, Masters, Professional, PhD
- Instructor:
- Name: Prof. Cliff Stein
- Office: 326 Mudd
- Phone: 212-854-5238
- Email: cliff@ieor.columbia.edu
- Office hours: Th 4:00-5:30, and by appointment.
- Teaching Assistants:
- Name: Ian Erb
- Office: 122A Mudd
- Phone:
- Email: ire2102@columbia.edu
- Office hours: T 1-2, Th 1-2, Th 6-7
- Name: Aaron Bernstein
- Office: 122A Mudd
- Email: ab3417@columbia.edu
- Office hours: M 12-1, W 12-1
- Name: Moses Nakamura
- Office: 122A Mudd
- Phone:
- Email: mnn2104@columbia.edu
- Office hours: W 2:30-3:30, F 12-1
- Name: Yundi Zhang
- Office: 122A Mudd
- Phone:
- Email: yz2351@columbia.edu
- Office hours: M 1-2, W 3:30-4:30
- Time: T Th 2:40-3:55
- Location: 501 Northwest Corner Building
- Textbook: Introduction
to Algorithms (Third Edition), by Thomas H. Cormen, Charles E.
Leiserson, Ronald L. Rivest, and Cliff Stein.
- Exams: There will
be one take-home midterm, and an in-class final exam. The exams must be
done entirely by yourselves. The midterm may be followed up by an oral
defense of the work.
- Grading:
- Homeworks: 30% (Details on homework
grading are here.)
- Midterm exam: 35%
- Final exam : 35%
- Getting help: You can get help in the course by:
- Visiting the instructor or TAs in their office hours
- Emailing the instructor or TAs
- Students with Disabilites:
We encourage students with disabilities, including invisible
disabilities such as chronic diseases and learning disabilities, to
discuss with the instructor any appropriate accommodations that we
might make on their behalf.
Announcements
Materials
