COSC 320 - Data Structures

Institution:

Pepperdine University

Subject:

Description:

Abstract data types, classes, and design patterns with the C++ language. Sorting algorithms Cinsertion sort, merge sort, heapsort, quicksort. Linear data structure s -stacks, queues, linked lists. Hash tables. Tre e s-binary search trees, 2-3 trees, B-trees, abstract syntax trees. Disjoint sets. Gra p hs-search algorithms, spanning trees, Kruskal's and Dijkstra's algorithms. Prerequisite: COSC 22

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.pepperdine.edu/

Phone Number:

(310) 506-4000

Regional Accreditation:

Western Association of Schools and Colleges

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.