Introduction
Introduction to programming, data structures, and algorithm design, using one or more modern imperative language, as chosen by the instructor.
Students will learn: basic programming constructs, data types, advanced and balanced search trees; hashing; asymptotic complexity analysis; standard algorithm design techniques; graph algorithms; sort algorithms; and other “classic’ algorithms that serve as examples of design techniques.
Students will be given regular programming assignments.
Teacher
Philippos Mordohai