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 |
|---|---|---|---|---|
| B | MWF | 08:30 AM - 09:20 AM | Dr. Hongbing Fan | |
| L1 | M | 09:30 AM - 10:20 AM | Mr. Heider Ali | |
| L2 | M | 10:30 AM - 11:20 AM | Mr. Heider Ali | |
| L3 | T | 08:30 AM - 09:20 AM | Mr. Heider Ali | |
| L4 | T | 09:30 AM - 10:20 AM | Mr. Heider Ali | |
| L5 | T | 10:30 AM - 11:20 AM | Mr. Heider Ali | |
| L6 | T | 11:30 AM - 12:20 PM | Mr. Heider Ali |