COMPSCI 2FA3 - Discrete Mathematics with Applications II

3 unit(s)

Finite state automata and grammars, predicate logic and formal proofs, models of computation, complexity, modular arithmetics, and their applications to computing.
Three lectures, one tutorial (one hour); second term

Prerequisite(s): COMP SCI 1FC3 or 2DM3 or SFWRENG 2DM3

Antirequisite(s): SFWR ENG 2E03, 2F03
Cross-list(s): SFWRENG 2FA3