CS 173

CS 173 - Discrete Structures

Spring 2027

Title	Rubric	Section	CRN	Type	Hours	Times	Days	Location	Instructor
Discrete Structures	CS173	ADA	48264	DIS	0	1000 - 1050	M	0216 Siebel Center for Comp Sci
Discrete Structures	CS173	ADB	48265	DIS	0	1100 - 1150	M	0216 Siebel Center for Comp Sci
Discrete Structures	CS173	ADC	48266	DIS	0	1200 - 1250	M	0216 Siebel Center for Comp Sci
Discrete Structures	CS173	ADD	71614	DIS	0	1400 - 1450	M	0216 Siebel Center for Comp Sci	Margaret M Fleck
Discrete Structures	CS173	AL1	39311	LEC	3	0930 - 1045	T R	3039 Campus Instructional Facility	Margaret M Fleck
Discrete Structures	CS173	AL2	61102	LEC	3	0930 - 1045	T R	3039 Campus Instructional Facility	Margaret M Fleck
Discrete Structures	CS173	BDA	61915	DIS	0	1530 - 1645	T	3039 Campus Instructional Facility	Daniel Gonzalez Cedre
Discrete Structures	CS173	BDB	61916	DIS	0	1530 - 1645	R	3039 Campus Instructional Facility	Daniel Gonzalez Cedre
Discrete Structures	CS173	BL1	50094	LEC	3	1200 - 1250	M W F	141 Wohlers Hall	Daniel Gonzalez Cedre
Discrete Structures	CS173	BL2	50093	LEC	3	1200 - 1250	M W F	141 Wohlers Hall	Daniel Gonzalez Cedre
Discrete Structures	CS173	BL3	31187	LEC	3	1300 - 1350	M W F	141 Wohlers Hall	Daniel Gonzalez Cedre
Discrete Structures	CS173	BL4	48263	LEC	3	1300 - 1350	M W F	141 Wohlers Hall	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