Computer Science 253 - Algorithms and Data Structures

Institution:

St Olaf College

Subject:

Description:

This course surveys standard data structures and algorithms with emphasis on implementation experience and complexity analysis. Topics include algorithmic strategies, fundamental computer algorithms, stacks, queues, lists, trees, hash tables, specialized trees (e.g., binary, AVL, B-trees), heaps and priority queues, compression, and decompression. Prerequisites: Completion of BTS-T; Computer Science 231 and either Computer Science 125 or 251, or consent of the instructor.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.stolaf.edu

Phone Number:

(507) 786-2222

Regional Accreditation:

North Central Association of Colleges and Schools

Calendar System:

Four-one-four plan

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.