Middlebury
header image

CSCI0302

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.
Subject:
Computer Science
Department:
Computer Science
Division:
Natural Sciences
Requirements Fulfilled:
DED
Equivalent Courses:

Sections

Spring 2015

CSCI0302A-S15 Lecture

Spring 2014

CSCI0302A-S14 Lecture (Dickerson)

Spring 2013

CSCI0302A-S13 Lecture (Kauchak)

Spring 2012

CSCI0302A-S12 Lecture (Kauchak)

Spring 2011

CSCI0302A-S11 Lecture (Dickerson)

Spring 2010

CSCI0302A-S10 Lecture (Dickerson)

Spring 2009

CSCI0302A-S09 Lecture (Martin)

Spring 2008

CSCI0302A-S08 Lecture (Martin)

Spring 2007

CSCI0302A-S07 Lecture (Dickerson)

Spring 2006

CSCI0302A-S06 Lecture (Martin)

Spring 2005

CSCI0302A-S05 Lecture (Dickerson)

Spring 2004

CSCI0302A-S04 Lecture (Martin)