This site uses cookies. By continuing to use this site, closing this banner, or clicking "I Agree", you agree to the use of cookies.
Read our cookies policy and privacy statement for more information.
Stand with UkraineDonate
- Home
- Tennessee
- East Tennessee State University
- Course info
- csci-5610 - formal-languages-and-computational-complexity
East Tennessee State University Course Info
Johnson City, Tennessee
Course Info
Search for courses by clicking on letters of the alphabet or by using a search bar. Explore course description, number of credits required and course sequences to satisfy graduation requirements.
CSCI 5610
Formal Languages and Computational Complexity
Problem-solving is a fundamental aspect of computer science. This course teaches students how to reduce a computational problem to its simplest form and analyze the problem to determine its inherent computational complexity. Topics include formal languages and automata theory, Turing machines, computational complexity, and the theory of NP-completeness.
Units: 3.0
Prerequisites:
CSCI 2210 - Data Structures
and
MATH 2710 - Discrete Structures