CS 2250 A (CRN: 10639)
Computer Science: Computability& Complexity
3 Credit Hours—Seats Available!
Registration
About CS 2250 A
Formal languages and expressiveness. Turing completeness and Church's Thesis. Decidability and tractability. Complexity classes and theory of NP completeness. Prerequisites: CS 1640 or MATH 2055. Co-requisite: CS 2240.
Notes
Prereqs enforced by the system: CS 1640 or MATH 2055; Coreq: CS 2240; Open to Degree and PACE students
Section Description
Introduction to automata, formal languages, computability, and complexity theory.
Section Expectation
Prior exposure to materials in CS 1640 Discrete Structures (or equivalent) and CS 2240 Data Structures and Algorithms.
Evaluation
Regular active learning exercises and quizzes; three exams; five homework assignments.
Important Dates
Note: These dates may not be accurate for select courses during the Summer Session.
Courses may be cancelled due to low enrollment. Show your interest by enrolling.
| Last Day to Add | |
|---|---|
| Last Day to Drop | |
| Last Day to Withdraw with 50% Refund | |
| Last Day to Withdraw with 25% Refund | |
| Last Day to Withdraw |
Resources
There are no courses that meet this criteria.