Introduction to Theory of Computation
The intent of the Introduction to Theory of Computation Knowledge Unit is to provide students with the basic knowledge of finite automata and their application to computation.
Topics
- Analysis of Algorithms
- Complexity measures
- Best, worst, and average complexity
- Upper and lower bounds on complexity
- Classes of Complexity
- Formal language theory
Outcomes
- Describe the theory of abstract machines or automata and what can be computed with them.
- Differentiate the characteristics of computable and non-computable functions.
- Describe the concept of complexity and quantify the resources required for computation of basic problems.
KSA-T
Below are the Knowledge, Skills, Abilities and Tasks (KSA-T) identified as being required to perform this work role.
Learn More about the KAS-T's.
| ID |
DESCRIPTION |
| K0015 |
Knowledge of computer algorithms. |
| K0018 |
Knowledge of encryption algorithms |
| K0325 |
Knowledge of Information Theory (e.g., source coding, channel coding, algorithm complexity theory, and data compression). |
