CS 2250 A (CRN: 93106)

Computer Science: Computability& Complexity (A)

3 credit hours

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; Open to Degree and PACE students

Section Description

First course on automata, computability, and complexity.

Evaluation

Weekly quizzes, exams (3), homework (5 or 6), weekly active learning exercises.

Important Dates

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

Other Sections