CS260 Data Structure I
Students study the merge of abstract data types and the algorithms which manipulatethem. Topics include: the study of elementary searching and sorting algorithms and hashing, object oriented implementation strategies for stacks, lists, queues, trees and hash tables. 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.
Offered
Fall