CMPU 102 - Computer Science II: Data Structures and Algorithms

Semester Offered: Fall and Spring
1 unit(s)

Continues CMPU 101. Examines object-oriented programming and associated algorithms using more complex data structures as the focus. Discusses nested structures and non-linear structures, such as stacks, queues, linked lists, trees, heaps, maps, and graphs. Emphasizes abstraction, encapsulation, inheritance, polymorphism, recursion, and object-oriented design patterns. Applies these concepts to sample applications that illustrate the breadth of computer science. A weekly laboratory period provides guided hands-on experience. The department.

Prerequisite(s): CMPU 101.

Open to all classes.

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

Two 75-minute periods plus laboratory.

Course Format: CLS