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 |
|---|---|---|---|---|---|---|---|---|---|
| 30044R | 050 | Lecture | 1:00-3:15pm | WThF | 18 of 35 | Aaron Cote | KAP163 |   | |
| 30045R | 050 | Discussion | 4:00-6:05pm | Friday | 18 of 35 | KAP163 | | ||
| 30046R | 050 | Quiz | TBA | TBA | 18 of 35 | OFFICE | |