Home
Evaluations
Tags
Lectures
Sandbox
About
Contribute
Evaluations
Tags
Lectures
About
Back
Question:
2017 Fall Midterm - 10
Author: Michiel Smid
A bitstring is called 01-
free
if it does not contain 01. Let $n \geq 2$ be an integer. How many 01-free bitstrings of length $n$ are there?
(a)
$n+2$
(b)
$n+1$
(c)
$n$
(d)
$n-1$
COMP 2804: Discrete Structures II
COMP 2804 Midterm
Counting 00-Free Bitstrings (4.2.1)