CP414B - Foundations of Computing (Fall 2026)
Wilfrid Laurier University•Waterloo, ON
•Onsite
About The Position
This course covers deterministic and nondeterministic finite automata (DFAs and NFAs), regular expressions, context-free grammars, the relationship between push-down automata and context-free grammars, the definition of the classes P and NP, NP-completeness (Cook's theorem), standard NP-complete problems, reduction techniques, and Turing machines, including the halting problem.
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 CP414B – Foundations of Computing course.
- Deliver lectures on topics including finite automata, regular expressions, context-free grammars, P and NP classes, NP-completeness, reduction techniques, and Turing machines.
- Assess student performance through grading and other evaluation methods as per the collective agreement.
- Coordinate large classes or multi-section courses as per Article 28.3.
Benefits
- Supplementary Remuneration for marking and grading allowance (see Article 28.2).
Stand Out From the Crowd
Upload your resume and get instant feedback on how well it matches this job.
Upload and Match Resume
What This Job Offers
Job Type
Part-time
Career Level
Mid Level
