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 |
|---|---|---|---|---|---|---|---|---|---|
| 29903D | 050 | Lecture | 9:00-11:20am | MWF | 38 of 40 | Michael Shindler | SOSB44 |  | |
| 29904R | 050 | Discussion | 12:30-2:30pm | Tuesday | 38 of 40 | VKC101 | | ||
| 29905R | 050 | Quiz | TBA | TBA | 38 of 40 | OFFICE | |