Directory of Classes
NOTE: Course information changes frequently. Please re-visit these pages periodically for the most recent and up-to-date information.

Spring 2019 Computer Science and Operations Research W4231 section 003
ANALYSIS OF ALGORITHMS I

Call Number 18737
Day & Time
Location
MW 10:10am-11:25am
833 Seeley W. Mudd Building
Points 3
Grading Mode Standard
Approvals Required None
Instructor Christos H Papadimitriou
Type LECTURE
Method of Instruction Classroom
Course Description Prerequisites: (COMS W3134 or COMS W3136COMS W3137) and (COMS W3203) 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.
Web Site Vergil
Department Computer Science
Enrollment 90 students (110 max) as of 9:05PM Wednesday, September 18, 2019
Final Exam Day/Time
W 9:00am-12:00pm
Final Location 833 Seeley W. Mudd Building
Subject Computer Science and Operations Research
Number W4231
Section 003
Division Interfaculty
Open To Architecture, Planning, and Preservation, School of the Arts, Barnard, Columbia College, Engineering and Applied Science: Undergraduate, Engineering and Applied Science: Graduate, Graduate School of Arts and Science, General Studies, Global Programs
Campus Morningside
Section key 20191CSOR4231W003

Home      About This Directory      Online Bulletins      ColumbiaWeb      SSOL
SIS update 09/18/19 21:05    web update 09/18/19 21:19