Middlebury

CSCI 0302

Algorithms and Complexity

Algorithms and Complexity
This course focuses on the development of correct and efficient algorithmic solutions to computational problems, on the underlying data structures to support these algorithms, and on the social implications of algorithms. Topics include computational complexity, analysis of algorithms, proof of algorithm correctness, some advanced data structures, algorithmic techniques including greedy and dynamic programming, and the consequences of real-world applications of algorithms. The course complements the treatment of NP-completeness in CSCI 0301. (CSCI 0200 and CSCI 0201) 3 hrs. lect./disc.
Subject:
Computer Science
Department:
Computer Science
Division:
Natural Sciences
Requirements Fulfilled:
DED
Equivalent Courses:

Sections in Spring 2011

Spring 2011

CSCI0302A-S11 Lecture (Dickerson)