Barnard College

CSOR W 4231x Analysis of Algorithms I

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. - M. Yannakakis
Prerequisites: COMS W3134, W3136, or W3137, and W3203. General Education Requirement: Quantitative and Deductive Reasoning (QUA).
3 points Lect: 3.

Course
Number
Call Number/
Section
Days & Times/
Location
Instructor Enrollment
Spring 2014 :: CSOR W4231
CSOR
4231
26731
001
TuTh 7:10p - 8:25p
309 HAVEMEYER HALL
X. Chen 96 / 120 [ More Info ]
CSOR
4231
85802
002
M 7:00p - 9:30p
501 NORTHWEST CORNER
E. Drinea 85 / 120 [ More Info ]
Autumn 2014 :: CSOR W4231
CSOR
4231
28745
001
TuTh 11:40a - 12:55p
TBA
M. Yannakakis 41 / 120 [ More Info ]