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 2020 Computer Science and Operations Research W4231 section 002
ANALYSIS OF ALGORITHMS I

Call Number 11694
Day & Time
Location
MTWR 5:40pm-6:55pm
ONLINE ONLY
Points 3
Grading Mode Standard
Approvals Required None
Instructor Alexandr Andoni
Type LECTURE
Method of Instruction On-Line Only
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
Subterm 10/26-12/14 (B)
Department Computer Science
Enrollment 74 students (150 max) as of 2:12PM Saturday, February 27, 2021
Subject Computer Science and Operations Research
Number W4231
Section 002
Division Interfaculty
Campus Morningside
Section key 20203CSOR4231W002

Home      About This Directory      Online Bulletins      ColumbiaWeb      SSOL
SIS update 02/27/21 14:12    web update 02/27/21 17:20