A continuation of the study of data structures and their applications using C. Linked lists, binary search trees, balanced search trees. Hashing, collision-avoidance strategies. A continuation of basic algorithm analysis.
3 lecture hours, 1 lab hour
|Lecture C||MW||-||2C16||Mr. David Brown|
|Lab L1||M||-||BA113||Mr. David Brown|
Regulations: Faculty of Science Regulations