CMPU 102 - Data Structures and Algorithms

Semester Offered: Fall and Spring
1 unit(s)

Explores ways to solve computational problems by organizing data in canonical data structures and associated algorithms, using an object-oriented programming language. Data structures that realize common abstract data types such as lists, queues, stacks, maps, and trees are studied in depth. Additionally, common algorithm design techniques and asymptotic analysis are introduced. A weekly laboratory period provides guided hands-on experience. The Department.

Prerequisite(s): CMPU 101 or AP CS A score of 4 or 5.

Open to all classes.

CMPU 102 and CMPU 145 may be taken in either order or concurrently.

Two 75-minute periods and one 2-hour lab.

Course Format: CLS