Abstract: The course is continues the study of design of class hierarchies and introduces interactions. It covers the principles of object oriented program design, the basic rules of program evaluation, and examines the relationship between algorithms and data structures, as well as basic techniques for analyzing algorithm complexity.

The course is suitable for both CS majors and non-majors. It assumes that student has been introduced to the basic principles of program design and the design of class hierarchies in an object oriented language.

Prerequisites: The course assumes a basic familiarity with the design of programs and class hierarchies in any programming language, and some mathematical maturity. It also demands curiosity and self-driven exploration.