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
30044R055Lecture12:30-1:50pmMTuWTh22 of 35Aaron CoteKAP140feesession datesbook list
30045R055Discussion1:00-3:00pmFriday22 of 35KAP140session dates
30046R055QuizTBATBA22 of 35OFFICEsession dates
Information accurate as of 7/27/2015 2:19 PM.