CS 173
CS 173 - Discrete Structures
Spring 2021
| Title | Rubric | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|---|
| Discrete Structures | CS173 | AL1 | 39311 | OLC | 3 | 0930 - 1045 | T R | Margaret M Fleck | |
| Discrete Structures | CS173 | AL2 | 61916 | OLC | 3 | 0930 - 1045 | M F | Margaret M Fleck | |
| Discrete Structures | CS173 | ALP | 61102 | OLC | 3 | 0930 - 1045 | T R | Margaret M Fleck | |
| Discrete Structures | CS173 | ALR | 61917 | OLC | 3 | 0930 - 1045 | M F | Margaret M Fleck | |
| Discrete Structures | CS173 | BL1 | 72799 | OLC | 3 | 1530 - 1645 | T R | Benjamin Cosman | |
| Discrete Structures | CS173 | BL2 | 50094 | OLC | 3 | 1230 - 1345 | T R | Benjamin Cosman | |
| Discrete Structures | CS173 | BLP | 72800 | OLC | 3 | 1530 - 1645 | T R | Benjamin Cosman | |
| Discrete Structures | CS173 | BLR | 50093 | OLC | 3 | 1230 - 1345 | T R | Benjamin Cosman | |
| Discrete Structures | CS173 | CL1 | 48263 | OLC | 3 | 0930 - 1045 | T R | Madhusudan Parthasarathy Margaret M Fleck Naina Balepur Seth Poulsen | |
| Discrete Structures | CS173 | CLQ | 48264 | OLC | 3 | 0930 - 1045 | T R | Madhusudan Parthasarathy Margaret M Fleck Naina Balepur Seth Poulsen |
See full schedule from Course Explorer
Official Description
Subject Area
- Theory / Math
Course Director
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