CP264: Data Structures II
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
Credit: 0.50
Prerequisite: CP164
Exclusion: CP114
| Section | Days | Times | Room | Instructor |
|---|---|---|---|---|
| Lecture B | MWF | - | N1001 | Dr. Hongbing Fan |
| Lab L1 | M | - | BA113 | |
| Lab L2 | M | - | BA113 | |
| Lab L3 | T | - | BA113 | |
| Lab L4 | T | - | BA113 | |
| Lab L5 | T | - | BA113 |