| Call Number | 10756 |
|---|---|
| Day & Time Location |
TR 1:00pm-4:10pm To be announced |
| Points | 3 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructor | Nakul Verma |
| 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/27-07/03 (A) |
| Department | Computer Science |
| Enrollment | 0 students (120 max) as of 10:06AM Saturday, February 22, 2025 |
| Subject | Computer Science and Operations Research |
| Number | W4231 |
| Section | 001 |
| Division | Interfaculty |
| Section key | 20252CSOR4231W001 |