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. Prerequisites: CSCI 103L and CSCI 109. Duplicates credit in former CSCI 271.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 30111R | 001 | Lecture | 12:00-1:50pm | Mon, Wed | 111 of 120 | Michael Shindler | ZHS159 | PDF (109988 KB) |    |
| 30008R | 001 | Lecture | 10:00-11:50am | Mon, Wed | 116 of 120 | Michael Shindler | ZHS159 | PDF (109988 KB) | |
| 30116R | 001 | Discussion | 2:00-3:50pm | Friday | 66 of 66 | SLH100 | | ||
| 30349R | 001 | Discussion | 4:00-5:50pm | Friday | 35 of 65 | SLH100 | | ||
| 30373R | 001 | Discussion | 10:00-11:50am | Friday | 66 of 68 | SOSB46 | | ||
| 30377R | 001 | Discussion | 12:00-1:50pm | Friday | 61 of 66 | SOSB46 | | ||
| 30343R | 001 | Quiz | TBA | Thursday | 227 of 255 | OFFICE |  |