CS 111: Discrete Structures

← 2024-25 2025-26
← 2023-24 ← 2023-24 changes (lax) changes (strict) ▾

Units: 4

Hours: Lecture, 3 hours; discussion, 1 hour

Catalog page 279

Prerequisites: CS 010A; CS 011 or MATH 011; MATH 009C or MATH 09HC; MATH 031 or EE 020B

Description: A study of discrete mathematical structures emphasizing applications to computer science. Topics include number theory and cryptography, asymptotic notation, recurrence equations, counting methods, elements of graph theory, and trees.

Enrollment History (from UCR Banner, not catalog)
Year F W S Su Total
2025-26 161/200 178/195 173/225 33/38 545/658
2024-25 118/200 175/190 174/225 33/38 500/653
2023-24 187/247 221/240 212/250 27/30 647/767
2022-23 215/227 224/240 209/250 20/30 668/747
2021-22 183/300 192/220 159/200 49/51 583/771
2020-21 173/208 192/210 190/207 38/51 593/676
2019-20 124/140 178/190  77/105 39/51 418/486
2018-19 133/140 148/163 120/120 34/50 435/473
2017-18  98/ 98 111/120  99/ 99 308/317
2016-17  81/ 98 116/120  68/ 90 265/308