Middlebury

CSCI0302A-F17

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):
91831
Subject Code:
CSCI
Course Number:
0302
Section Identifier:
A

Course

CSCI 0302

All Sections in Fall 2017

Fall 2017

CSCI0302A-F17 Lecture (Kimmel)