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.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
29954R001Lecture2:00-3:20pmTue, Thu71 of 81Aaron CoteSOSB2session dates
30008R001Lecture10:00-11:50amMon, Wed60 of 70Aaron CoteTHH210session dates
30111D001Lecture11:00-12:20pmTue, Thu65 of 71Aaron CoteZHS252session dates
30115D001Lecture2:00-3:20pmMon, Wed69 of 72Aaron CoteLVL17session dates
30116R001Discussion2:00-3:50pmFriday73 of 76SOSB2session dates
30349R001Discussion4:00-5:50pmFriday60 of 75SOSB46session dates
30373R001Discussion10:00-11:50amFriday69 of 70SOSB46session dates
30377R001Discussion12:00-1:50pmFriday63 of 72SLH102session dates
30343R001QuizTBAThursday265 of 291OFFICEnotesession dates
Information accurate as of October 14, 2020 2:01 pm.
The Fall 2020 semester will begin with fully remote instruction, with limited exceptions for clinical education. Faculty will contact students to provide information to login to classes. Read more.