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 | 97 of 105 | Aaron Cote | MRF340 |   | |
| 30010R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 75 of 76 | Aaron Cote | ZHS352 | | |
| 30115R | 001 | Lecture | 2:00-3:20pm | Tue, Thu | 74 of 76 | Aaron Cote | ZHS252 | | |
| 30116R | 001 | Discussion | 6:00-7:50pm | Monday | 44 of 50 | KAP156 | | ||
| 30349R | 001 | Discussion | 5:00-6:50pm | Tuesday | 69 of 70 | THH212 | | ||
| 30373R | 001 | Discussion | 4:00-5:50pm | Wednesday | 67 of 68 | THH210 | | ||
| 30377D | 001 | Discussion | 4:00-5:50pm | Monday | 66 of 69 | THH210 | |