Spring 2024 Computer Science and Operations Research E4231 section 001

ANALYSIS OF ALGORITHMS I

Call Number 11942
Day & Time
Location
MW 4:10pm-5:25pm
313 Fayerweather
Points 3
Grading Mode Standard
Approvals Required None
Instructor Rachel Cummings
Type LECTURE
Method of Instruction In-Person
Course Description

Prerequisites: COMS W3134, COMS W3136, or COMS 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 Industrial Engineering and Operations Research
Enrollment 39 students (78 max) as of 12:06PM Tuesday, December 3, 2024
Subject Computer Science and Operations Research
Number E4231
Section 001
Division School of Engineering and Applied Science: Graduate
Open To Engineering:Undergraduate, Engineering:Graduate
Section key 20241CSOR4231E001