COM SCI 288S

Seminar: Theoretical Computer Science

Computer Science · 2 units · Graduate courses (200-299)

Open the requisite map View official UCLA course listing ↗Find on Bruinwalk ↗

Intended for students undertaking thesis research. Discussion of advanced topics and current research in such areas as algorithms and complexity models for parallel and concurrent computation, and formal language and automata theory. May be repeated for credit.

S/U grading.

Requisites

Official UCLA wording
Requisites: courses 280A, 281A.

BruinTree reads · Prerequisite

confidence 1.00 · from text

all of

Requires

Everything that has to come before this course, not just the courses named in the requisite above.

COM SCI 288S

COM SCI 280AAlgorithms
- COM SCI 180Introduction to Algorithms and Complexity
  - COM SCI 32Introduction to Computer Science II1 more beneath
  - MATH 61Introduction to Discrete Structures2 more beneath
COM SCI 281AComputability and Complexity
- COM SCI 181Theory of Computing
  - COM SCI 180Introduction to Algorithms and Complexityanother path to it

2 direct requisites. Showing 7 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.

Unlocks

What this course is a requisite for, and what those courses lead to in turn.

No course in the catalog lists this as a requisite.