CS 173 - Discrete Structures

Spring 2022

TitleRubricSectionCRNTypeHoursTimesDaysLocationInstructor
Discrete StructuresCS173ADA31187DIS00900 - 0950 F  3039 Campus Instructional Facility Benjamin Cosman
Discrete StructuresCS173ADH61915DIS01600 - 1650 F  3039 Campus Instructional Facility Benjamin Cosman
Discrete StructuresCS173AL139311LEC30930 - 1045 T R  1002 Electrical & Computer Eng Bldg Benjamin Cosman
Discrete StructuresCS173ALP61102LEC30930 - 1045 T R  1002 Electrical & Computer Eng Bldg Benjamin Cosman
Discrete StructuresCS173BDB48267DIS01000 - 1050 F  3039 Campus Instructional Facility Payam Delgosha
Discrete StructuresCS173BDF51089DIS01400 - 1450 F  3039 Campus Instructional Facility Payam Delgosha
Discrete StructuresCS173BL250094LEC31230 - 1345 T R  0027/1025 Campus Instructional Facility Payam Delgosha
Discrete StructuresCS173BLR50093LEC31230 - 1345 T R  0027/1025 Campus Instructional Facility Payam Delgosha
Discrete StructuresCS173CDA71613DIS01000 - 1050 F  1111 Siebel Center for Comp Sci Madhusudan Parthasarathy
Discrete Structures- HonorsCS173CL171611LEC30930 - 1045 T R  0216 Siebel Center for Comp Sci Madhusudan Parthasarathy
Discrete Structures-HonorsCS173CLQ71612LEC30930 - 1045 T R  0216 Siebel Center for Comp Sci Madhusudan Parthasarathy
Discrete StructuresCS173DDA57329DIS01100 - 1150 F  3039 Campus Instructional Facility 
Discrete StructuresCS173DL157330LEC30930 - 1045 T R  3039 Campus Instructional Facility 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