Home
Evaluations
Tags
Lectures
Sandbox
About
Contribute
Evaluations
Tags
Lectures
About
Back
Solution:
2013 Fall Midterm - 5
Author: Pat Morin
Question
How many bitstrings of length 55 start with 101 or end with 1111?
(a)
$2^{52} + 2^{51} - 2^{48}$
(b)
$2^{52} + 2^{51}$
(c)
$2^{55} - 2^{52} - 2^{51}$
(d)
$2^{55} - 2^{48}$
COMP 2804: Discrete Structures II
Counting Bitstrings of Length n (3.1.1)
The Principle of Inclusion and Exclusion (3.5)
Solution
Let A be the set of all bitstrings of length 55 that start with 101.
$ |A| = 2^{55-3} = 2^{52} $
Let B be the set of all bitstrings of length 55 that end with 1111.
$ |B| = 2^{55-4} = 2^{51} $
Let $A \cap B$ be the set of all bitstrings of length 55 that start with 101 and end with 1111.
$ |A \cap B| = 2^{55-3-4} = 2^{48} $
$ |A \cup B| = |A| + |B| - |A \cap B| $
$ |A \cup B| = 2^{52} + 2^{51} - 2^{48} $
Contribute