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 |
|---|---|---|---|---|---|---|---|---|---|
| 29947R | 001 | Lecture | 3:30-4:50pm | Mon, Wed | 53 of 60 | Leana Golubchik | MHP105 |   | |
| 29948R | 001 | Discussion | 5:00-5:50pm | Wednesday | 53 of 60 | MHP105 | | ||
| 29949R | 001 | Lecture | 10:00-11:50am | Mon, Wed | 68 of 74 | Aaron Cote | ZHS252 | | |
| 29953R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 58 of 61 | Aaron Cote | THH114 | | |
| 29954R | 001 | Discussion | 10:00-10:50am | Friday | 59 of 65 | GFS116 | | ||
| 29957R | 001 | Discussion | 3:30-4:20pm | Thursday | 67 of 70 | GFS116 | |