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 |
|---|---|---|---|---|---|---|---|---|---|
| 30008R | 001 | Lecture | 10:00-11:50am | Mon, Wed | 90 of 91 | Aaron Cote | SLH102 |   | |
| 30108R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 81 of 91 | Aaron Cote | SLH100 | | |
| 30115R | 001 | Lecture | 4:00-5:20pm | Mon, Wed | 69 of 75 | Michael Shindler | ZHS352 | PDF (60115 KB) | |
| 30116R | 001 | Discussion | 2:00-3:50pm | Friday | 62 of 65 | GFS106 | | ||
| 30349R | 001 | Discussion | 4:00-5:50pm | Friday | 58 of 65 | SLH102 | | ||
| 30373R | 001 | Discussion | 10:00-11:50am | Friday | 61 of 65 | THH210 | | ||
| 30377R | 001 | Discussion | 12:00-1:50pm | Friday | 59 of 65 | ZHS352 | | ||
| 30343R | 001 | Quiz | TBA | Thursday | 240 of 255 | OFFICE |  |