Job Description

Position Summary

:

Finite and discrete algebraic structures relating to computers: sets, functions, relations. Machine-oriented logic. Topics include: propositional and predicate calculus, Boolean algebra, combinatorial counting (including Pigeonhole principle, permutations and combinations), recurrence equations, applications of recurrence equations in sorting algorithms, relations (including equivalence relations, partial orders), algorithms to generate permutations and combinations, induction and recursive , correctness proofs for both recursive and iterative program constructions, countable and uncountable sets, Cantor’s theorem, introduction to graph theory and graph algorithms.


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 mas...

    Apply for this Position

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

    Submit Application