An integrated approach to the study of data structures, algorithm analysis, and discrete mathematics. Topics include: induction and recursion, time and space complexity, and big-O notation, propositional logic, proof techniques, sorting, mathematical properties of data structures, including lists.

Pre-requisites: CS1302 and MATH 1634

Pre-requisites: CS1302 and MATH 1634

Category: Spring 2004