— Discrete Mathematics For Computer Science

Prerequisites & course information

Course Description: Discrete mathematics of particular utility to computer science. Proofs by induction. Propositional and first-order logic. Sets, functions, and relations. Big-O and related notations. Recursion and solutions of recurrence relations. Combinatorics. Probability on finite probability spaces. Graph theory. Learning Activities: Lecture 3 hour(s), Discussion 1 hour(s). Enrollment Restriction(s): Pass One open to Computer Science, Computer Science Engineering, Computer Engineering, and Cognitive Science Majors only. Grade Mode: Letter. General Education: Science & Engineering (SE); Quantitative Literacy (QL). Learning Activities: Lecture 3 hour(s), Discussion 1 hour(s). Enrollment Restriction(s): Pass One open to Computer Science, Computer Science Engineering, Computer Engineering, and Cognitive Science Majors only. Grade Mode: Letter. General Education: Science & Engineering (SE); Quantitative Literacy (QL).