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, Thu166 of 177Aaron CoteTHH301notesession dates
30295D001Lecture12:30-1:50pmTue, Thu155 of 167Aaron CoteSGM101notesession dates
30116R001Discussion2:00-3:50pmFriday111 of 115ZHS159session dates
30373R001Discussion10:00-11:50amFriday99 of 115ZHS159session dates
30377R001Discussion12:00-1:50pmFriday111 of 115ZHS159session dates
30343R001Quiz7:00-8:50pmWednesday321 of 344TBAsession dates
Information accurate as of June 24, 2022 6:09 am.
Did you find what you needed today? Let us know by taking a short survey.