Third course in the introduction to computer programming sequence. These topics include: creating, using and analyzing abstract data structures: stacks, queues, linked lists, maps, binary trees and heaps. Computational complexity will be analyzed using BigO, Theta and Omega notation. Prerequisite: CS 162 and either MTH 111 or MTH 251.