CS 173 - Discrete Structures

Fall 2021

TitleRubricSectionCRNTypeHoursTimesDaysLocationInstructor
Discrete StructuresCS173ADL51469OLB00930 - 1045 W    Benjamin Cosman
Discrete StructuresCS173AL130102LEC30930 - 1045 M  1404 Siebel Center for Comp Sci Benjamin Cosman
Discrete StructuresCS173ALP72280LEC30930 - 1045 M  1404 Siebel Center for Comp Sci Benjamin Cosman
Discrete StructuresCS173AX159602ONL30930 - 1045 M W    Benjamin Cosman
Discrete StructuresCS173AXR51495ONL30930 - 1045 M W    Benjamin Cosman
Discrete StructuresCS173BDA51500OLB01100 - 1215 W    Qian Zhou
Discrete StructuresCS173BL240083LEC31100 - 1215 M  1404 Siebel Center for Comp Sci Qian Zhou
Discrete StructuresCS173BLR72281LEC31100 - 1215 M  1404 Siebel Center for Comp Sci Qian Zhou
Discrete StructuresCS173BX163144ONL31100 - 1215 M W    Qian Zhou
Discrete StructuresCS173BXP51496ONL31100 - 1215 M W    Qian Zhou
Discrete StructuresCS173CDA71541OLB01530 - 1645 W    Benjamin Cosman
Discrete StructuresCS173CX171734LEC31530 - 1645 M  1320 Digital Computer Laboratory Benjamin Cosman
Discrete StructuresCS173CXR58923LEC31530 - 1645 M  1320 Digital Computer Laboratory Benjamin Cosman

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 124, CS 125, ECE 220; one of MATH 220, MATH 221.

Subject Area

Theory / Math

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