4 Units, Lecture, 3 hours; research, 3 hours. Prerequisite(s): CS 150; graduate standing. Covers phrase structure grammars and languages; turing machines; relation of languages to automata; solvable and unsolvable problems; and theoretical limitations of computers. Also examines algorithmic complexity theory; polynomial reducibility; the classes P and NP; and correctness proofs. May be taken Satisfactory (S) or No Credit (NC) with consent of instructor and graduate advisor.
Other grades
University of California, Riverside
Reviews, study tips, and grade data for CS 215 at UCR. 4 Units, Lecture, 3 hours; research, 3 hours. Prerequisite(s): CS 150; graduate standing. Covers phrase…
Also in CS
Also in CS
Also in CS
Also in CS
Also in CS
Also in CS
The course page is taking longer to load. This summary is still available.
We could not load the full course details. This summary is still available.
Still loading. This can take a moment on a slow connection.
Loading My Class Grades