Catalog Entries

Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course.

COMP 2150 - CS2:Data Structures
Principles of object-oriented programming and software development; problem solving with recursion and abstract data types, including linked lists, stacks, queues; basic sort and search algorithms. PREREQUISITE: MATH 1910 or MATH 1421 (or MATH 1830 for COMP minors) and COMP 1900. COREQUISITE: COMP 2700 and COMP 2701 for COMP majors. (F, Sp, Su) 3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture Computer Science Department

COMP 2150 - CS2:Data Structures

Principles of object-oriented programming and software development; problem solving with recursion and abstract data types, including linked lists, stacks, queues; basic sort and search algorithms. PREREQUISITE: MATH 1910 or MATH 1421 (or MATH 1830 for COMP minors) and COMP 1900. COREQUISITE: COMP 2700 and COMP 2701 for COMP majors. (F, Sp, Su)
3.000 Credit hours
3.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture

Computer Science Department

Return to Previous	New Search		XML Extract

Skip to top of page

University of Memphis TRN7

Catalog Entries

© 2025 Ellucian Company L.P. and its affiliates.

Catalog Entries		Spring Term 2015 Jul 09, 2025