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 |
|---|---|---|---|---|---|---|---|---|---|
| 30008R | 001 | Lecture | 10:00-11:50am | Mon, Wed | 112 of 120 | Sandra Batista | ZHS159 |  | |
| 30111R | 001 | Lecture | 11:00-12:20pm | Tue, Thu | 63 of 72 | Aleksandra Korolova | ZHS252 | | |
| 30115R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 92 of 95 | Michael Shindler | SLH102 | PDF (109116 KB) | |
| 30116R | 001 | Discussion | 2:00-3:50pm | Friday | 68 of 73 | GFS116 | | ||
| 30349R | 001 | Discussion | 4:00-5:50pm | Friday | 61 of 72 | GFS116 | | ||
| 30373R | 001 | Discussion | 10:00-11:50am | Friday | 69 of 73 | SLH102 | | ||
| 30377R | 001 | Discussion | 12:00-1:50pm | Friday | 69 of 72 | SLH102 | | ||
| 30343R | 001 | Quiz | TBA | Thursday | 267 of 290 | OFFICE |  |