Middlebury
header image

CSCI0302A-S13

Algorithms and Complexity

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.
Course Reference Number (CRN):
20471

Course

CSCI0302

All Sections in Spring 2013

Spring 2013

CSCI0302A-S13 Lecture (Kauchak)