| |
Nov 25, 2024
|
|
|
|
|
CSC 014 - (MA, CS) Discrete Structures for Computer Science ISemester Hours: 3
Fall, Spring
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.)
Prerequisite(s)/Course Notes:
Three years of high school mathematics.
Add to Personal Catalog (opens a new window)
|
|