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:50pmMWThF20 of 35Aaron CoteKAP158feesession datesbook list
30045R055Discussion12:30-2:30pmTuesday20 of 35Aaron CoteKAP158session dates
30046R055QuizTBATBA20 of 35OFFICEsession dates
Information accurate as of 8/12/2016 3:15 PM.