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
30115R001Lecture10:00-11:50amMon, Wed11 of 60Leana GolubchikVPD116notefeesession datesbook list
30373R001Discussion10:00-11:50amFriday11 of 60THH212session dates
30343R001QuizTBATBA2 of 60OFFICEsession dates
30008R001Lecture11:00-12:20pmTue, Thu59 of 75Michael ShindlerSLH100feesession datesbook list
30010R001Lecture2:00-3:20pmTue, Thu63 of 75Aaron CoteZHS252feesession datesbook list
30108R001Lecture12:30-1:50pmTue, Thu66 of 70Michael ShindlerMHP105feesession datesbook list
30116R001Discussion2:00-3:50pmFriday69 of 72THH212session dates
30349R001Discussion12:00-1:50pmFriday68 of 72THH212session dates
30377R001Discussion8:00-9:50amFriday51 of 72THH212session dates
29976R001Quiz5:00-6:50pmThursday197 of 240TBAsession dates
Information accurate as of 3/11/2015 2:55 PM.