CSOR W4231 Analysis of Algorithms, I
* The information contained in this syllabus is subject to change at any time.
View a video preview of this course
Course Description:
This course is an 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.
Faculty/Manager:
Cliff Stein
Contact Information:
Cliff Stein
email: cliff@ieor.columbia.eduCredits for Course: 3 Viewing Schedule: 2 lectures per week Prerequisites: Introductory courses in Data Structures & Algorithms (COMS W3139) and Discrete Mathematics (COMS W3203)
* The information contained in this syllabus is subject to change at any time.