MATH 61Introduction to Discrete Structures
Mathematics · 4 units · Undergraduate lower division (0-99)
Not open for credit to students with credit for course 180 or 184. Discrete structures commonly used in computer science and mathematics, including sets and relations, permutations and combinations, graphs and trees, induction.
P/NP or letter grading.
When it runs
Checking the Schedule of Classes…
Requisites
Official UCLA wording
Requisites: courses 31A, 31B.
Requires
Everything that has to come before this course, not just the courses named in the requisite above.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
MATH 61
- MATH 180Graph Theory
- MATH 182Algorithms
- COM SCI 161Fundamentals of Artificial Intelligence
- COM SCI 163Deep Learning for Computer Vision
- COM SCI 263CAnimats-Based Modeling
- COM SCI 170AMathematical Modeling and Methods for Computer Science
- COM SCI 181Theory of Computing
- COM SCI 234Computer-Aided Verification
- COM SCI 284ATopics in Automata and Languages
- COM SCI 284CTopics in Automata and Languages
- COM SCI 284PTopics in Automata and Languages
- COM SCI 183Introduction to Cryptography
- COM SCI 205Health Analytics
- COM SCI 245Big Data Analytics
- COM SCI 246Web Information Management
- COM SCI 258GLogic Synthesis of Digital Systems
- MATH 184Enumerative Combinatorics
4 courses list this as a requisite. Showing 22 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.