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.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
30108D001Lecture9:30-10:50amTue, Thu176 of 186Aaron CoteTHH201notesession dates
30295D001Lecture12:30-1:50pmTue, Thu174 of 185Aaron CoteTHH101notesession dates
30116R001Discussion2:00-3:50pmFriday97 of 100SLH200session dates
30349R001Discussion8:00-9:50amFriday66 of 90GFS106session dates
30373R001Discussion10:00-11:50amFriday93 of 100SAL101session dates
30377R001Discussion12:00-1:50pmFriday94 of 100THH202session dates
30343R001Quiz7:00-8:50pmWednesday350 of 371TBAsession dates
Information accurate as of September 13, 2023 1:50 pm.