CSC 420: Theory of Computation : 3 hours

Description

Covers the detailed comparative analysis of algorithms and their computational complexity. May also include formal language theory including finite automata, Turning machines, context-free grammars, and decidability. Prerequisite: MATH 210 and (CSC 122 or ITSC 122).

Goals for CSC 420 are:

1. Experience the theoritical underpinnings of computing
2. Understand proofs
3. Understand automatas and grammars
4. Understand Big-O
5. Understand P/NP/etc.

Course outcomes for CSC 420 are:

• Upon completion of CSC 420 students will understand:
  • the theory of computer science
  • Big O notation
  • N/NP problems
  • how to deal with complex material

Program outcomes for CSC 420 are:

1. Analyze a complex computing problem and to apply principles of computing and other relevant disciplines to identify solutions. (Computing student learning outcome 1)
2. Communicate effectively in a variety of professional contexts. (Computing student learning outcome 3)

Integration

To be determined