CP264 Data Structures II 0.5 |
A continuation of the study of data structures and their applications. Abstract Data Types, heaps, binary search trees, balanced search trees. Hashing, collision-avoidance strategies. Basic algorithmic analysis, big "O" and little "o" notation. |
Prerequisite: CP114. |
3 lecture hours, 1 lab hour |
![]() ![]() ![]() |
![]() ![]() ![]() |
Official electronic version updated at 4:25 p.m. December 18, 2003