| Call Number | 11531 |
|---|---|
| Points | 3 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructor | Nakul Verma |
| 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 | 05/27-07/03 (A) |
| Department | Video Network |
| Enrollment | 1 student (99 max) as of 9:05PM Thursday, April 3, 2025 |
| Subject | Computer Science and Operations Research |
| Number | W4231 |
| Section | V01 |
| Division | Interfaculty |
| Open To | Engineering:Graduate |
| Fee | $395 CVN Course Fee |
| Note | VIDEO NETWORK STUDENTS ONLY |
| Section key | 20252CSOR4231WV01 |