Directory of Classes

NOTE: Course information changes frequently, including Methods of Instruction. Please revisit these pages periodically for the most recent and up-to-date course information.


Fall 2022 Computer Science and Operations Research W4231 section 001
ANALYSIS OF ALGORITHMS I

Call Number 11058
Day & Time
Location
TR 11:40am-12:55pm
451 Computer Science Building
Points 3
Grading Mode Standard
Approvals Required None
Instructor Mihalis Yannakakis
Type LECTURE
Method of Instruction In-Person
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 103 students (110 max) as of 5:52PM Tuesday, December 6, 2022
Subject Computer Science and Operations Research
Number W4231
Section 001
Division Interfaculty
Campus Morningside
Section key 20223CSOR4231W001

Home      About This Directory      Online Bulletins      ColumbiaWeb      SSOL
SIS update 12/06/22 17:52    web update 12/06/22 21:13