Home
Evaluations
Tags
Lectures
Sandbox
About
Contribute
Evaluations
Tags
Lectures
About
Back
Question:
2018 Fall Final - 3
Author: Michiel Smid
Consider strings of length 70, in which each character is one of the letters $a, b, c$. How many such strings have exactly 12 letters $c$
or
exactly 30 letters $b$?
(a)
None of the above.
(b)
${70 \choose 12} \cdot 2^{58} + {70 \choose 30} \cdot 2^{40}$
(c)
${70 \choose 12} + {70 \choose 30} - {58 \choose 30}$
(d)
${70 \choose 12} \cdot 2^{58} + {70 \choose 30} \cdot 2^{40} - {70 \choose 12} \cdot {58 \choose 30}$
COMP 2804: Discrete Structures II
COMP 2804 Final Exam
Permutations and Binomial Coefficients (3.6.2)
The Product Rule (3.1)
Counting Bitstrings of Length n (3.1.1)
The Principle of Inclusion and Exclusion (3.5)