CS 173

CS 173 - Discrete Structures

Spring 2020

Title	Rubric	Section	CRN	Type	Hours	Times	Days	Location	Instructor
Discrete Structures	CS173	ADA	31187	DIS	0	1000 - 1050	F	1111 Siebel Center for Comp Sci	Keval Mahendra Morabia
Discrete Structures	CS173	ADB	48263	DIS	0	1100 - 1150	F	1111 Siebel Center for Comp Sci	Weilin Zhang
Discrete Structures	CS173	ADC	48264	DIS	0	1200 - 1250	F	1111 Siebel Center for Comp Sci	Weilin Zhang
Discrete Structures	CS173	ADD	57329	DIS	0	1300 - 1350	F	1111 Siebel Center for Comp Sci	Hantian Ding
Discrete Structures	CS173	ADE	57330	DIS	0	1400 - 1450	F	1214 Siebel Center for Comp Sci	Hantian Ding
Discrete Structures	CS173	ADF	57446	DIS	0	1500 - 1550	F	1111 Siebel Center for Comp Sci	Aniket Murhekar
Discrete Structures	CS173	ADG	48265	DIS	0	1600 - 1650	F	1111 Siebel Center for Comp Sci	Aniket Murhekar Peilun Zhang
Discrete Structures	CS173	ADH	61915	DIS	0	1700 - 1750	F	1111 Siebel Center for Comp Sci	Peilun Zhang
Discrete Structures	CS173	ADI	61916	DIS	0	1800 - 1850	F	1111 Siebel Center for Comp Sci	Shubham Singhal
Discrete Structures	CS173	ADJ	61917	DIS	0	0900 - 0950	F	1111 Siebel Center for Comp Sci	Keval Mahendra Morabia
Discrete Structures	CS173	ADK	65173	DIS	0	1900 - 1950	F	1111 Siebel Center for Comp Sci	Shubham Singhal
Discrete Structures	CS173	AL1	39311	LEC	3	0930 - 1045	T R	1002 Electrical & Computer Eng Bldg	Margaret M Fleck
Discrete Structures	CS173	ALP	61102	LEC	3	0930 - 1045	T R	1002 Electrical & Computer Eng Bldg	Margaret M Fleck
Discrete Structures	CS173	BDA	48266	DIS	0	1300 - 1350	R	1111 Siebel Center for Comp Sci	Yang Liu
Discrete Structures	CS173	BDB	48267	DIS	0	1400 - 1450	R	1111 Siebel Center for Comp Sci	Yang Liu Yang Yu
Discrete Structures	CS173	BDC	50441	DIS	0	1500 - 1550	R	1111 Siebel Center for Comp Sci	Yang Yu
Discrete Structures	CS173	BDD	50442	DIS	0	1600 - 1650	R	1111 Siebel Center for Comp Sci	Devansh Paresh Shah
Discrete Structures	CS173	BDE	51087	DIS	0	1700 - 1750	R	1111 Siebel Center for Comp Sci	Devansh Paresh Shah Wendy Shi
Discrete Structures	CS173	BDF	51089	DIS	0	1800 - 1850	R	1111 Siebel Center for Comp Sci	Wendy Shi
Discrete Structures	CS173	BL2	50094	LEC	3	1100 - 1215	T R	1404 Siebel Center for Comp Sci	Yael Gertner
Discrete Structures	CS173	BLR	50093	LEC	3	1100 - 1215	T R	1404 Siebel Center for Comp Sci	Yael Gertner

See full schedule from Course Explorer

Official Description

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 for both CS 173 and MATH 213. Prerequisite: One of CS 125, ECE 220; one of MATH 220, MATH 221. Class Schedule Information: Students must register for a lecture and discussion section.

Subject Area

Theory / Math

Course Director

Benjamin Leverett Cosman
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

Assessment and Revisions

Revisions in last 6 years	Approximately when revision was done	Reason for revision
New Textbook	Spring 11-Spring 2013	Integrate logic and proof learning throughout term, relate math to applications, modernize
On-line activities	Fall 2011-Spring 2013 (on-going)	Move simple material out of lectures, aid learning with drill, help students prepare for lectures and be more engaged,
On-line homework submission with rubric grading	Fall 2012-Spring 2013	Simplify submission process, encourage quality writing product, enable research into automated feedback

Required, Elective, or Selected Elective

Required

Last updated

2/3/2019by Margaret M. Fleck