Job Description

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.

Please note:

  • Instructors must work within departmental guidelines on Connect

  • Final exams will be in-person for all first and second-year courses (Lecture and Online)

    • Qualifications – Required: Applicants must possess a master’s degree in computer science or a closely related field from an accredited institution. Candidates are expected to demonstrate current engagement in scholarly or applied research, evidenced by recent publications in relevant areas of the discipline.



    Qualifications – Areas of Specialization:     The position is open to candidates acr...

    Apply for this Position

    Ready to join Wilfrid Laurier University? Click the button below to submit your application.

    Submit Application