CP414F - Foundations of Computing (Winter 2027)
Wilfrid Laurier University•Waterloo, ON
•Onsite
About The Position
This course covers fundamental concepts in theoretical computer science. Topics include 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 complexity classes P and NP, NP-completeness (Cook's theorem), standard NP-complete problems, reduction techniques, and Turing machines. The course also addresses the halting problem.
Requirements
- Master’s degree
- Computer Science or related field
- Demonstrated expertise in the subject field
- Recent scholarly activity related to the course content
- CV
- Candidate Application Form (CAF)
Nice To Haves
- PhD would be an asset
Responsibilities
- Deliver lectures on the Foundations of Computing.
- Cover topics including finite automata, regular expressions, context-free grammars, complexity classes P and NP, NP-completeness, Turing machines, and the halting problem.
Benefits
- Supplementary Remuneration for marking and grading allowance
- Coordination of large classes or multi-section courses
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
