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 |
|---|---|---|---|---|---|
| D | Waterloo | TR | 05:30 PM - 06:50 PM | SB107 | Mr. Haytham Qushtom |
| L1 | Waterloo | W | 01:00 PM - 02:20 PM | BA113 | Ms Xuyang Ma |
| L2 | Waterloo | W | 02:30 PM - 03:50 PM | BA113 | Ms Xuyang Ma |
| OC1 | Online Learning | - | Dr. Evgueni Zima |
The educational materials developed for this course, including, but not limited to, lecture notes and slides, handout materials, examinations and assignments, and any materials posted to MyLearningSpace, are the intellectual property of the course instructor. These materials have been developed for student use only and they are not intended for wider dissemination and/or communication outside of a given course. Posting or providing unauthorized audio, video, or textual material of lecture content to third-party websites violates an instructor's intellectual property rights, and the Canadian Copyright Act. Recording lectures in any way is prohibited in this course unless specific permission has been granted by the instructor. Failure to follow these instructions may be in contravention of the university's Code of Student Conduct and/or Code of Academic Conduct, and will result in appropriate penalties. Participation in this course constitutes an agreement by all parties to abide by the relevant University Policies, and to respect the intellectual property of others during and after their association with Wilfrid Laurier University.