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
29955D001Lecture8:00-9:20amTue, Thu67 of 70Michael ShindlerWPHB27PDF (152535 KB)session datesbook list
30008D001Lecture10:00-11:50amMon, Wed58 of 60Olivera GrujicGFS101session datesbook list
30111D001Lecture11:00-12:20pmTue, Thu73 of 74Michael ShindlerZHS252session datesbook list
30115D001Lecture2:00-3:20pmMon, Wed69 of 70Michael ShindlerSLH100session datesbook list
30295D001Lecture12:30-1:50pmTue, Thu31 of 50Olivera GrujicSLH102session dates
30116R001Discussion2:00-3:50pmFriday77 of 80Michael ShindlerGFS106session dates
30349R001Discussion4:00-5:50pmFriday67 of 80Michael ShindlerGFS116session dates
30373R001Discussion10:00-11:50amFriday
80 of 80
SLH102session dates
30377R001Discussion12:00-1:50pmFriday74 of 80Michael ShindlerSLH102session dates
29976R001Quiz7:00-8:50pmThursday54 of 80TBAnotesession dates
30343R001Quiz7:00-8:50pmThursday244 of 270Michael ShindlerOFFICEnotesession dates
Information accurate as of May 20, 2019 5:01 pm.