CS260 — Data Structures I
CS 260 - Data Structures I CS 260 - Data Structures I 4 Credit(s) Topics include the study of elementary searching and sorting algorithms and hashing, and object-oriented implementation strategies for stacks, lists, queues, trees, binary trees, B-trees, and hash tables. For each data structure examined, common and useful algorithms that utilize such structures will be studied. Course also covers an introduction and application of complexity analysis: asymptotic analysis of upper and average complexity bounds, Big O(), Theta() and Omega() notation, as well as a general introduction to resource consumption, including the tradeoff between time and space. Course Learning
Prerequisites: CS162U, CS234U, MTH111Z