WGU C960 Discrete Mathematics II Latest 2023 Graded A+

WGU C960 Discrete Mathematics II Latest 2023 Graded A+ Ω(n) Lower bound Θ(n) Average O(n) Upper bound When to use combinations Closed Form arithmetic sequence Closed form geometric sequence Counting: Product Rule |a1|x|a2|x|a3| Counting: Sum Rule r-Permutation A sequence of r items chosen from n total items in which the order of the items matters Permutation A sequence of n items in which the order of the items matters and every item in a set is included exactly once (n!) r-Subset (or r-combination) A sequence of r items chosen from n total items in which the order of the items does not matter (nCr or n chooses r) Counting Multisets A collection that can have multiple instances of the same kind of item ( (n+m-1)!/ (m-1)!n! ) Bayes' Theorem The probability of an event occurring based upon other event probabilities. Random variables function from the sample space S of an experiment to the real numbers. X(S) denotes the range of the function X. (Σ s=S x(s)p(s))