CP 414

Foundations of Computing

Lec A selected

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. The halting problem. <br>

Sections

Lecture, pick one

Lec A

Mon, Wed 10:00-11:20

Mon, Wed10:00-11:20Lazaridis Hall LH10101807

Lec B

Mon, Wed 19:00-20:20

Mon, Wed19:00-20:20Lazaridis Hall LH10093867

Lec C

Mon, Wed 16:00-17:20

Mon, Wed16:00-17:20Bricker Academic Building BA1124832

Lec D

Tue, Thu 16:00-17:20

Tue, Thu16:00-17:20Bricker Academic Building BA1124834

Syllabus

Have the syllabus for CP 414? Share it and everyone gets the grading, textbooks and rules.