CP264A - Data Structures II (Fall 2026)
Wilfrid Laurier University•Waterloo, ON
•Onsite
About The Position
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. Data structures for graphs and elementary graph algorithms. A continuation of basic algorithm analysis.
Requirements
- Master’s degree in Computer Science or related field.
- Demonstrated expertise in the subject field.
- Recent scholarly activity related to the course content.
- CV
- Candidate Application Form (CAF)
- Names and Contact Information for Referees (for external applicants)
- Evidence of Good Teaching (for external applicants)
- Verification of highest degree (for external applicants)
Nice To Haves
- PhD would be an asset.
Responsibilities
- Teach CP264A - Data Structures II course.
- Conduct lectures on linked lists, binary search trees, balanced search trees, hashing, collision-avoidance strategies, data structures for graphs, and elementary graph algorithms.
- Provide instruction on basic algorithm analysis.
- Grade assignments and exams.
- Potentially coordinate large classes or multi-section courses.
- Potentially provide marking and grading allowance.
Benefits
- Supplementary Remuneration for marking and grading allowance (see Article 28.2)
- Coordination of large classes or multi-section courses (see Article 28.3)
Stand Out From the Crowd
Upload your resume and get instant feedback on how well it matches this job.
Upload and Match Resume
What This Job Offers
Job Type
Part-time
Career Level
Mid Level
