C+IN SC 3223 - Data Structures and Algorithms

Institution:

Temple University

Subject:

Description:

Comparative analysis of algorithms and data structures. Data structures include heaps, priority queues, binary and general trees, binary search trees, AVL trees, Red-Black trees, B-trees, and graphs. Algorithms include heapsort, topological sort, breadth-first search, depth-first search, shortest path algorithms, and Greedy algorithms. Students will gain experience working in a group on at least one moderate-size project.

Note: For Computer Science Majors (For BA CS Majors see your advisor).

Credits:

4.00

Credit Hours:

Prerequisites:

Grade of C or better in the CS theory course (C+IN SC 2166 (0166), 3211 (0211), or 3242 (0242)) and in C+IN SC 2168 (0068); Grade of C or better in MATH 1042 (0086)

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture/Lab

Notes:

Additional Information:

Historical Version(s):

Institution Website:

WWW.TEMPLE.EDU

Phone Number:

(215) 204-7000

Regional Accreditation:

Middle States 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.