| Call Number | 12400 |
|---|---|
| Day & Time Location |
MW 1:10pm-2:25pm To be announced |
| 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 |
| Department | Computer Science |
| Enrollment | 0 students (70 max) as of 9:06PM Thursday, October 9, 2025 |
| Subject | Computer Science and Operations Research |
| Number | W4231 |
| Section | 002 |
| Division | Interfaculty |
| Section key | 20261CSOR4231W002 |