CSSE 250 - Data Structures

Institution:

Seattle University

Subject:

Description:

Abstract data types. Big-Oh notation. Heaps, sorting (Quicksort, Mergesort, Heapsort), binary search trees, tree balancing techniques, and hashing. Additional topics may include B trees. Prerequisite: C (2.00) or better in CSSE 152.

Credits:

5.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.seattleu.edu

Phone Number:

(206) 296-6000

Regional Accreditation:

Northwest Commission on Colleges and Universities

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.