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
30111R001Lecture12:00-1:50pmMon, Wed111 of 120Michael ShindlerZHS159PDF (109988 KB)feesession datesbook list
30008R001Lecture10:00-11:50amMon, Wed116 of 120Michael ShindlerZHS159PDF (109988 KB)feesession datesbook list
30116R001Discussion2:00-3:50pmFriday
66 of 66
SLH100session dates
30349R001Discussion4:00-5:50pmFriday35 of 65SLH100session dates
30373R001Discussion10:00-11:50amFriday66 of 68SOSB46session dates
30377R001Discussion12:00-1:50pmFriday61 of 66SOSB46session dates
30343R001QuizTBAThursday227 of 255OFFICEnotesession dates
Information accurate as of September 13, 2017 12:07 pm.