CP214C - Discrete Struct for Comp Sci (Winter 2027)

Wilfrid Laurier University•Waterloo, ON

2d•Onsite

About The Position

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 programs, correctness proofs for both recursive and iterative program constructions, countable and uncountable sets, Cantor’s theorem, introduction to graph theory and graph algorithms.

Requirements

Master’s degree in Computer Science or related field.
Demonstrated expertise in the subject field.
Recent scholarly activity related to the course content.
CV (required).
Candidate Application Form (CAF) (required).
Names and Contact Information for Referees (required for external applicants).
Evidence of Good Teaching (required for external applicants).
Verification of highest degree (required for external applicants).

Nice To Haves

PhD would be an asset.

Responsibilities

Teach lectures for CP214C - Discrete Structures for Computer Science.
Develop and deliver course content.
Assess student performance through grading and feedback.
Utilize AI tools in the hiring process (Note: The posting explicitly states 'No' for AI tools in the hiring process for this position, but this is a general statement about the role's responsibilities if applicable in other contexts).
Adhere to the Contract Teaching Faculty and Part-time Librarians Collective Agreement.