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. BC: Fulfillment of General Education Requirement: Quantitative and Deductive Reasoning (QUA)..
3 points

Course
Number
Call Number/
Section
Days & Times/
Location
Instructor Enrollment
Spring 2016 :: CSOR W4231
CSOR
4231
69630
001
TuTh 7:10p - 8:25p
309 HAVEMEYER HALL
A. Lewko 127 / 250 [ More Info ]
CSOR
4231
91303
002
TuTh 5:40p - 6:55p
833 SEELEY W. MUDD BUILDING
E. Drinea 90 / 100 [ More Info ]
Autumn 2016 :: CSOR W4231
CSOR
4231
69378
001
TuTh 11:40a - 12:55p
428 PUPIN LABORATORIES
M. Yannakakis 108 / 110 [ More Info ]
CSOR
4231
60133
002
TuTh 5:40p - 6:55p
207 MATHEMATICS BUILDING
A. Andoni 108 / 110 [ More Info ]
CSOR
4231
19268
H01
TBA M. Yannakakis 52 / 50 [ More Info ]