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.


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

Call Number 10916
Day & Time
Location
TR 1:00pm-4:10pm
833 Seeley W. Mudd Building
Points 3
Grading Mode Standard
Approvals Required None
Instructor Alexandr Andoni
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
Subterm 05/23-07/01 (A)
Department Computer Science
Enrollment 39 students (120 max) as of 9:04AM Monday, November 28, 2022
Subject Computer Science and Operations Research
Number W4231
Section 001
Division Interfaculty
Campus Morningside
Section key 20222CSOR4231W001

Home      About This Directory      Online Bulletins      ColumbiaWeb      SSOL
SIS update 11/28/22 09:04    web update 11/28/22 09:24