This course provides an accelerated coverage of programming techniques for students with programming experience from an introductory programming course. Topics covered include: basics of classes, inheritance, and data abstraction; linear data structures (vectors, lists, stacks, and queues); trees and simple graphs; hash tables; sorting and searching; and recursion. Students will learn basic algorithm analysis. Numerous labs and programming assignments will build skills in planning, problem solving, and debugging: this is a hands-on course.