Computer Science 25 - Algorithms

Institution:

Dartmouth College

Subject:

Description:

08F: 10 09F: Arrange A survey of fundamental algorithms and algorithmic techniques, including divide-and-conquer algorithms, lower bounds, dynamic programming, greedy algorithms, amortized analysis, and graph algorithms. Presentation, implementation and formal analysis, including space/time complexity and proofs of correctness, are all emphasized. Prerequisite: Computer Science 8 and Computer Science 19. Dist: QDS. Jayanti.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.dartmouth.edu

Phone Number:

(603) 646-1110

Regional Accreditation:

New England Association of Schools and Colleges

Calendar System:

Quarter

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.