CPS 231 - Computer Science III/Data Structures

Credits: 3
Lecture Hours: 3
Lab Hours: 0
This course covers the fundamentals of data structures and software modeling. Topics include: analysis of algorithms (order notation), abstract properties, implementation and use of stacks, queues, linked lists, and binary trees, binary search trees, recursion and efficiency of recursive solutions, range of search (sequential, binary), select (min, max, median) and sort algorithms (quicksort, merge sort, heap sort) and their time and space efficiencies, software quality assurance (pre and post conditions, program testing), and professional responsibilities associated with software development.
Prerequisite(s): CPS 142 with a grade of C or better