 |
601.433/633 Introduction to Algorithms
When: Tuesday and Thursday, noon-1.15pm
Where: Hodson 110
Textbook: Cormen, Leiserson, Rivest, and Stein, "Introduction to Algorithms," Third Edition
Instructor: Vladimir Braverman
TA: Nikita Ivkin
TA: Alan Liu
Office: Malone 210
Phone: (410) 516-4975
Office Hours: Thursday 1.30-3pm
Syllabus
Schedule
Discussions: Piazza
Homework Submission: Gradescope (please use enrollment code: 9D5RDG)
Additional Materials: Blackboard
This course concentrates on the design of algorithms and the rigorous analysis of their efficiency. Topics include the basic definitions of algorithmic complexity (worst case, average case); basic tools such as dynamic programming, sorting, searching, and selection; advanced data structures and their applications (such as union-find); graph algorithms and searching techniques such as minimum spanning trees, depth-first search, shortest paths, design of randomized algorithms and competitive analysis. Prerequisites: EN.601.226, EN.550.171.
Students are expected to adhere to the
Department of Computer Science Academic Integrity Code.