Computer Science 170:
Discrete Methods in Computer Science (4.0 units)
Sets, functions, series. Big-O notation and algorithm analysis. Propositional and first-order logic. Counting and discrete probability. Graphs and basic graph algorithms. Basic number theory.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 30153R | 055 | Lecture | 2:20-3:40pm | MWThF | 34 of 40 | Aaron Cote |  | ||
| 30154R | 055 | Discussion | 2:20-4:20pm | Tuesday | 34 of 40 | | |||
| 30155R | 055 | Quiz | TBA | TBA | 34 of 40 | OFFICE | |