CS 011: Introduction to Discrete Structures

← 2018-19 2019-20 2020-21 →
← 2018-19 ← 2018-19 changes (lax) changes (strict) ▾ 2020-21 → 2020-21 →

Units: 4

Hours: Lecture, 3 hours; discussion, 1 hour

Catalog page 234

Prerequisites: MATH 009A (or MATH 09HA); CS 010 or MATH 009B (or MATH 09HB)

Description: Introduction to basic concepts of discrete mathematics emphasizing applications to computer science. Topics include prepositional and predicate calculi, elementary set theory, functions, relations, proof techniques, elements of number theory, enumeration, and discrete probability.

Cross-listing: Cross-listed with MATH 011.

Derived Information — The following is not part of the official catalog but is computed from catalog data.

Serves as a prerequisite for

CS 111 MATH 126 MATH 140 PHIL 124
Prerequisite graph not available.

Referenced in

Enrollment History (from UCR Banner, not catalog)
Combined: CS 011 / MATH 011
Year F W S Su Total
2025-26  94/102 174/239 122/149 390/490
2024-25 151/210 228/297 118/159 13/30 510/696
2023-24 163/156 294/298 149/172 606/626
2022-23 146/150 245/246 138/138 28/30 557/564
2021-22 112/120 246/250 193/200 20/30 571/600
2020-21 109/120 232/300 154/210 12/30 507/660
2019-20 116/140 275/280 161/189 24/31 576/640
2018-19 119/130 204/204 168/209 27/30 518/573
2017-18 120/130 203/220 119/120 17/50 459/520
2016-17  88/ 95 150/150  94/120 14/50 346/415