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.
- Prerequisite: CSCI 102
- Note: Students must complete CSCI 102, or pass its challenge exam, or have AP Computer Science A credit to enroll in this course.
Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
---|---|---|---|---|---|---|---|---|---|
30108D | 001 | Lecture | 9:30-10:50am | Tue, Thu | 130 of 150 | Aaron Cote | THH201 | ||
30295D | 001 | Lecture | 12:30-1:50pm | Tue, Thu | 146 of 150 | Aaron Cote | THH101 | ||
30116R | 001 | Discussion | 2:00-3:50pm | Friday | 73 of 75 | SGM101 | |||
30349R | 001 | Discussion | 8:00-9:50am | Friday | 58 of 75 | GFS106 | |||
30373R | 001 | Discussion | 10:00-11:50am | Friday | 72 of 75 | SLH102 | |||
30377R | 001 | Discussion | 12:00-1:50pm | Friday | 73 of 75 | THH202 | |||
30343R | 001 | Quiz | 7:00-8:50pm | Wednesday | 276 of 300 | TBA |