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. Prerequisites: CSCI 103L and CSCI 109. Duplicates credit in former CSCI 271.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
30121R001Lecture11:00-12:20pmTue, Thu58 of 60Michael ShindlerGFS116PDF (86717 KB)feesession datesbook list
29947R001Lecture9:30-10:50amTue, Thu37 of 60Michael ShindlerSOSB46PDF (86717 KB)feesession datesbook list
29949R001Lecture10:00-11:50amMon, Wed58 of 60Michael ShindlerSSL150PDF (86717 KB)feesession datesbook list
29929R001Discussion4:00-5:50pmFriday28 of 65ZHS352session dates
29954R001Discussion2:00-3:50pmFriday61 of 65ZHS352session dates
29957R001Discussion12:00-1:50pmFriday64 of 65ZHS252session dates
30027R001Quiz7:00-8:50pmThursday153 of 200TBAsession dates
Information accurate as of October 27, 2016 5:33 pm.