CP414H - Foundations of Computing (Winter 2027)
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 of 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
- 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 Deterministic and nondeterministic finite automata (DFAs and NFAs), regular expressions, context-free grammars, relationship of push-down automata and context-free grammars, definition of the classes P and NP, NP-completeness (Cook's theorem), standard NP-complete problems, reduction techniques, Turing machines.
- Cover the halting problem.
- Deliver lectures for the course.
- Manage a class size of 85 students.
- Mark and grade assignments and exams.
- Coordinate with other instructors if applicable for large classes or multi-section courses.
Benefits
- Supplementary Remuneration for marking and grading allowance
- Coordination of large classes or multi-section courses allowance
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
