Units: 4 Terms Offered: FaSpSets, 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 or EE 109L) Duplicates Credit in former CSCI 271 Instruction Mode: Lecture, Discussion, Quiz Grading Option: Letter
You must be logged in to post a comment.