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
| 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
-
Computer Science: Computability& Complexity (CS 2250 B) Quick Course Review Quick View
This section is closed
- CRNCreditsInstructors
- 13061 3 Brian Lavallee
- DatesDays of the WeekTimes
- to Mon Wed Fri to
Remind Me Form
CS 2250 A is closed to new enrollment.
Fill out the form fields and you will be notified when the course is updated with details for next term. What can you do while you wait? Get your application started now by completing our pre-registration form.