CP312F - Algorithm Design/Analysis I (Winter 2027)

CP312F - Algorithm Design/Analysis I (Winter 2027)

Position Title: CP312F - 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 best, average, and worst-case behaviors of algorithms. Algorithmic strategies: brute force, greedy, 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

Areas of Specialization: n/a

Discipline: Computer Science or related field

Professional Designation: PhD would be an asset

Other: Preference will be given to applicants with demonstrated expertise in the subject field. Recent scholarly activity r...