Read our cookies policy and privacy statement for more information.
×Manchester, New Hampshire
Basic algorithmic analysis and strategies are explored along with fundamental computing algorithms. Connections between regular languages and finite automata, context-free languages and pushdown automata, and Turing machines and computation are established. The complexity classes P and NP will also be introduced.
Units: 3.0