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 |
|---|---|---|---|---|
| A | MWF | 01:30 PM - 02:20 PM | ||
| L1 | W | 08:30 AM - 09:20 AM | ||
| L2 | F | 11:00 AM - 11:50 AM |