Q&A section for all courses. Add courses and comments anonymously.

University of Waterloo

Waterloo, Ontario

1 vote

CS 365

Models of Computation

Finite automata and regular expressions. Pushdown automata and context-free grammars. Turing machines and undecidability. Time and space complexity. Diagonalization and hierarchies. CS 365 covers the material in CS 360 at an accelerated pace plus additional topics in computational complexity. [Note: CS 365 may be substituted for CS 360 in any degree plan or for prerequisite purposes; enrolment is restricted; see Note 1 above.] Prereq: CS 240, 241, MATH 239/249; Computer Science students only. Antireq: CS 360

No one knows about this easy way to avoid CS 360, and the marks are way higher. Small class, so you can't go to sleep in the back; better to skip lecture entirely, as most of us did.

Added by Anonymous on 2005-01-21 01:20:00

Log in with Facebook to add a comment

Log in with Facebook to participate in the Q&A.