CP214/GENG132MC1 - Discrete Structures I (Winter 2027)

Wilfrid Laurier University • Montreal, QC

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
• Computer Science or related field
• Demonstrated expertise in the subject field (preference given)
• Recent scholarly activity related to the course content
• CV
• Candidate Application Form (CAF)
• Names and Contact Information for Referees (for external applicants)
• Evidence of Good Teaching (for external applicants)
• Verification of highest degree (for external applicants)

Nice To Haves

• PhD would be an asset

Responsibilities

• Teach Discrete Structures I course.
• Develop and deliver lectures.
• Assess student performance.
• Utilize AI tools in the hiring process (Note: This is stated as 'No' for the hiring process itself, but the course content may involve AI concepts).
• Ensure course content aligns with the Collective Agreement and program-specific rubrics.

Benefits

• Supplementary Remuneration for marking and grading allowance (Article 28.2)
• Supplementary Remuneration for coordination of large classes or multi-section courses (Article 28.3)

What This Job Offers

• Job Type: Part-time
• Career Level: Mid Level