Algorithms and Complexity

This course focuses on the development of correct and efficient algorithmic solutions to computational problems, and on the underlying data structures to support these algorithms. Topics include computational complexity, analysis of algorithms, proof of algorithm correctness, advanced data structures such as balanced search trees, and also important algorithmic techniques including greedy and dynamic programming. The course complements the treatment of NP-completeness in CSCI 0301. (CSCI 0200 and CSCI 0201) 3 hrs. lect./disc.

Schedule
1:45pm-2:35pm on Monday, Wednesday, Friday (Sep 11, 2017 to Dec 8, 2017)
Location
McCardell Bicentennial Hall 538
Instructors