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.
- Prerequisite: CSCI 102
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 29947D | 001 | Lecture | 5:00-6:20pm | Mon, Wed | 142 of 151 | Shahriar Shamsian | SGM101 |  | |
| 30121D | 001 | Lecture | 6:30-7:50pm | Mon, Wed | 117 of 127 | Shahriar Shamsian | SGM101 | | |
| 29929R | 001 | Discussion | 4:00-5:50pm | Friday | 24 of 50 | GFS118 | | ||
| 29954R | 001 | Discussion | 2:00-3:50pm | Friday | 49 of 50 | THH114 | | ||
| 29980R | 001 | Discussion | 10:00-11:50am | Friday | 46 of 50 | THH210 | | ||
| 30106R | 001 | Discussion | 12:00-1:50pm | Friday | 48 of 50 | THH114 | | ||
| 30299R | 001 | Discussion | 12:00-1:50pm | Friday | 46 of 50 | THH116 | | ||
| 30300R | 001 | Discussion | 2:00-3:50pm | Friday | 46 of 50 | THH210 | | ||
| 30027R | 001 | Quiz | 7:00-8:50pm | Tuesday | 259 of 278 | TBA | |