CSCI 170 Discrete Methods in Computer Science

Units: 4
Terms Offered: FaSp

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.
Prerequisite: CSCI 103L and CSCI 109.
Duplicates Credit in CSCI 271.
Instruction Mode: Lecture, Discussion, Quiz
Grading Option: Letter