COMP 2150 - CS2:Data Structures

Institution:

University of Memphis

Subject:

Description:

Principles of object-oriented programming and software development; problem solving with recursion and abstract data types, including linked lists, stacks, queues, trees, binary search trees; basic sort and search algorithms. PREREQUISITE: MATH 1910 (or MATH 1830 for non computer science majors) and COMP 1900 or EECE 1207. COREQUISITE: COMP 2701, MATH 2701. (F, Sp, Su)

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.memphis.edu

Phone Number:

(901) 678-2000

Regional Accreditation:

Southern 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.