CP312C - Algorithm Design/Analysis I (Fall 2026)

Position Summary

Analysis of the best, average and worst-case behaviors of algorithms. Algorithmic strategies: brute force algorithms, greedy algorithms, divide-and-conquer, branch and bound, backtracking. Fundamental computing algorithms: O(n log n) sorting, hash table, binary trees, depth- and breadth-first search of graphs.

Qualifications – Required: Master’s degree
Qualifications - Areas of Specialization: n/a
Qualifications – Discipline: Computer Science or related field
Qualifications - Professional Designation: PhD would be an asset
Qualifications – Other: Preference will be given to applicants with demonstrated expertise in the subject field. Recent scholarly activity related to the course content

Salary: $10,212.40

Application Deadline: June 13, 2026

Submit with Application:

Required for All Applicants