CS 258 - Computer Science III

4 credits
Studies Abstract Data Types (ADT) and its algorithms. Topics include Arrays and Dynamic Memory allocation, and Recursion. Elementary (linear) data structures: stacks, lists, queues, and trees (Binary and AVL). Also, the study of elementary searching and sorting algorithms. The course also covers an introduction and application of complexity analysis: asymptotic analysis of upper and average complexity bounds, O(), Theta() and Omega() notation, as well as a general introduction to resource consumption, including the tradeoff between time and space. Prerequisite(s): CS 257 with a C or better; and MTH 251 with a C- or better or appropriate SOU placement level.
Grade mode designated on a CRN basis each term. Students should consult current term schedule.