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 | Campus | Days | Times | Room | Instructor |
|---|---|---|---|---|---|
| C | MW | 11:30 AM - 12:50 PM | Mr. Qutaiba Albluwi | ||
| L1 | M | 01:30 PM - 02:20 PM | Dr. Heider Ali |