CST 280 - Computer Science III:Data Structures

Institution:

Roosevelt University

Subject:

Description:

Continues the use of C++ to study abstract data types such as sets, trees, heaps, hash tables, and the concepts of inheritance and recurrence relations. Algorithmic strategies such as divide and conquer, greedy, and back-tracking. Algorithms include random number generation, searching, sorting, and string processing. Complexity analysis includes the big O, big omega, big theta, and little o. A computer use course. Extensive programming required. Prereq: Cst 250 and Math 245. (3 Credits)

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.roosevelt.edu

Phone Number:

(312) 341-3500

Regional Accreditation:

North Central Association of Colleges and Schools

Calendar System:

Semester

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.