CS 3151 Data Structures and Discrete Mathematics I 2/2/3

Prerequisite: CS 1302 with a minimum grade of B and MATH 1634 with a minimum grade of C

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.