CSC 014 - (MA, CS) Discrete Structures for Computer Science ISemester Hours: 3
Review of propositional and predicate logic. Methods of theorem proving; strong and weak induction. Finite and infinite sets, set operations. Introductions to computational complexity, theta and big-O notation Combinatorics, including permutations and combinations. Discrete probability and binomial distribution. (3 hours lecture, 1 hour laboratory.)
Three years of high school mathematics.
Click here for Fall 2021 course offering(s).
Click here for January 2022 course offering(s).
Click here for Spring 2022 course offering(s).
Add to Personal Catalog (opens a new window)