CS 173

CS 173 - Discrete Structures

Fall 2026

Title	Rubric	Section	CRN	Type	Hours	Times	Days	Location	Instructor
Discrete Structures	CS173	ED1	60279	DIS	0	1000 - 1050	M	0216 Siebel Center for Comp Sci
Discrete Structures	CS173	ED2	63143	DIS	0	1300 - 1350	M	0216 Siebel Center for Comp Sci
Discrete Structures	CS173	ED3	71539	DIS	0	1400 - 1450	M	0216 Siebel Center for Comp Sci
Discrete Structures	CS173	ED4	63145	DIS	0	1500 - 1550	M	0216 Siebel Center for Comp Sci
Discrete Structures	CS173	ED5	63146	DIS	0	1600 - 1650	M	0216 Siebel Center for Comp Sci
Discrete Structures	CS173	EL1	51495	LEC	3	1230 - 1350	T R	3039 Campus Instructional Facility	Carl Evans
Discrete Structures	CS173	EL2	51497	LEC	3	1230 - 1350	T R	3039 Campus Instructional Facility	Carl Evans
Discrete Structures	CS173	EL3	40083	LEC	3	1400 - 1515	T R	1404 Siebel Center for Comp Sci	Carl Evans
Discrete Structures	CS173	EL4	72281	LEC	3	1400 - 1515	T R	1404 Siebel Center for Comp Sci	Carl Evans
Discrete Structures	CS173	GD1	71541	LBD	0	1600 - 1650	F	0035 Campus Instructional Facility	Daniel Gonzalez Cedre
Discrete Structures	CS173	GD2	71734	LBD	3	1500 - 1550	F	0035 Campus Instructional Facility	Daniel Gonzalez Cedre
Discrete Structures	CS173	GL1	30102	LEC	3	1400 - 1450	M W F	100 Noyes Laboratory	Daniel Gonzalez Cedre
Discrete Structures	CS173	GL2	72280	LEC	3	1400 - 1450	M W F	100 Noyes Laboratory	Daniel Gonzalez Cedre

See full schedule from Course Explorer

Web Page

https://courses.grainger.illinois.edu/cs173/sp2026/

Official Description

[IAI Code: CS915] Discrete mathematical structures frequently encountered in the study of Computer Science. Sets, propositions, Boolean algebra, induction, recursion, relations, functions, and graphs. Course Information: Credit is not given toward graduation for: Credit is not given for both CS 173 and MATH 213. Prerequisite: One of CS 124, CS 125, ECE 220; one of MATH 220, MATH 221.

Subject Area

Theory / Math

Course Director

Margaret M Fleck

Text(s)

Varies

Learning Goals

Predicate logic: determine the truth of statements, perform simple transformations (esp. negation), accurately apply formal definitions (esp. vacuous truth cases, attention to variable types and scope) (6)
Write literate proofs using straightforward application of standard outlines (direct, contrapositive, contradiction, upper/lower bounds). (3)
Write inductive proofs, including proofs on trees (3), (6)
State and apply basic definitions, facts, and notation for commonly used discrete math constructs (3)
Derive big-O running time for simple pseudocode examples, especially recursive examples. Includes finding closed-forms for recursively-defined formulas using unrolling and recursion trees (6)
Classify examples the complexity of very simple examples in terms of countable versus uncountable, polynomial versus exponential, decidable versus undecidable (6)

Topic List

logic and proofs
number theory
sets and collections of sets
relations
functions
graphs
Induction and recursive definition
trees
big-O, algorithms, NP
state diagrams
countability

Required, Elective, or Selected Elective

Required

Last updated

2/3/2019by Margaret M. Fleck