CMPS 385 - Data Structures

Institution:

University of La Verne

Subject:

Description:

Algorithms and data structures. Arrays. Lists. Stacks and queues. Tree structures. Searching and sorting algorithms. Files. Lab included. 4.000 Credit Hours Course Attributes: BS Computer Sci/Engr Elective Prerequisites: Undergraduate level CMPS 367 Minimum Grade of C- or Undergraduate level MATH 367 Minimum Grade of C-

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.laverne.edu/

Phone Number:

(909) 593-3511 ext 4900

Regional Accreditation:

Western Association of Schools and Colleges

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.