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.

Lecture Hours: 3.00 Lab Hours: 2.00Total Hours: 4.00

View all current and previous class web sites for this course at MoodleExternal Link to Moodle