COM SCI 280D
Algorithms
Computer Science · 4 units · Graduate courses (200-299)
Additional requisites for each offering announced in advance by department. Selections from design, analysis, optimization, and implementation of algorithms; computational complexity and general theory of algorithms; algorithms for particular application areas. Subtitles of some current sections: Principles of Design and Analysis (280A); Distributed Algorithms (280D); Graphs and Networks (280G). May be repeated for credit with consent of instructor and topic change.
Letter grading.
Requisites
Official UCLA wording
Requisite: course 180.
BruinTree reads · Prerequisite
confidence 1.00 · from textRequires
Everything that has to come before this course, not just the courses named in the requisite above.
COM SCI 280D
- COM SCI 180Introduction to Algorithms and Complexity
- COM SCI 32Introduction to Computer Science II
- COM SCI 31Introduction to Computer Science I
- MATH 61Introduction to Discrete Structures
- MATH 31BIntegration and Infinite Series
1 direct requisite. Showing 6 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.