| |
Jan 13, 2025
|
|
|
|
|
CSC 14 - (MC) Discrete Structures for Computer Science I
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.)
Prerequisites & Notes
Three years of high school mathematics. (Formerly Discrete Mathematics.)
Credits: 3 s.h.
Add to Personal Catalog (opens a new window)
|
|