Job Description
Position Title
CP312MC1 - Algorithm Design and Analysis I
Term
Winter 2027 (January 1 – April 30)
Mode of Delivery
In-Person
Type of Instruction
Lecture
Anticipated Class Size
80
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 i...