CS 273

spring 2006

All Classes

Intro to Theory of Computation

Credit: 3 hours.

Finite automata and regular languages; pushdown automata and context-free languages; Turing machines and recursively enumerable sets; computability and the halting problem; undecidable problems; computational complexity and NP-completeness. Prerequisite: CS 125 and either CS 173 or MATH 213.

This course satisfies the General Education Criteria in Spring 2006 for:

Quantitative Reasoning II

Status Icon Legend

: Section Status Closed
: Section Status Open
: Section Status Pending
: Section Status Open (Restricted)
: Section Status Unknown

Section Status updates every 10 minutes.

- CS 101
- CS 105
- CS 125
- CS 173
- CS 196
- CS 199
- CS 210
- CS 225
- CS 231
- CS 232
- CS 241
- CS 242
- CS 257
- CS 273
- CS 296
- CS 397
- CS 411
- CS 413
- CS 414
- CS 417
- CS 418
- CS 419
- CS 420
- CS 421
- CS 423
- CS 424
- CS 425
- CS 428
- CS 429
- CS 431
- CS 433
- CS 435
- CS 438
- CS 440
- CS 446
- CS 450
- CS 455
- CS 462
- CS 465
- CS 473
- CS 477
- CS 493
- CS 494
- CS 498
- CS 499
- CS 512
- CS 522
- CS 523
- CS 526
- CS 533
- CS 536
- CS 548
- CS 549
- CS 554
- CS 570
- CS 572
- CS 573
- CS 576
- CS 591
- CS 597
- CS 598
- CS 599

Detail	Status		CRN	Type	Section	Time	Day	Location	Instructor