Search Results
Your search for · CS 254 · during 24FA · returned 1 result
-
CS 254 Computability and Complexity 6 credits
An introduction to the theory of computation. What problems can and cannot be solved efficiently by computers? What problems cannot be solved by computers, period? Topics include formal models of computation, including finite-state automata, pushdown automata, and Turing machines; formal languages, including regular expressions and context-free grammars; computability and uncomputability; and computational complexity, particularly NP-completeness.
- Fall 2024
- FSR, Formal or Statistical Reasoning
-
Student has completed any of the following course(s): CS 200 – Data Structures with Problem Solving or CS 201 – Data Structures AND CS 202 – Mathematics of Computer Science or MATH 236 – Mathematical Structures with a grade of C- or better or equivalent. MATH 236 will be accepted in lieu of Computer Science 202.
-
CS 254.00 Fall 2024
34 spots held for students in CS Match until 9:00 a.m. May 24
- Faculty:Chelsey Edge 🏫 👤
- Size:34
- M, WLanguage & Dining Center 104 11:10am-12:20pm
- FLanguage & Dining Center 104 12:00pm-1:00pm