CMPS102 Intermediate Programming with Data Structures

This course consolidates algorithm design and programming techniques, with an emphasis on abstract data types and object-oriented programming with Java. The course introduces students to the design, analysis, and implementation of data structures as well as some of the key algorithms operating them. Topics include lists, stacks, queues, deques, sets/maps, search trees (binary search trees and AVL trees), heaps/priority queues (heap sort), hash tables, and graphs (breadth-first search and depth-first search).

The course is taught to first-year Computer Science students.