187 views

1 Answer

Best answer
3 votes
3 votes
Total number of binary string of length $10$ is  $2^{10} =1024$ as each position has $2$ options - $0$ or $1.$

Number of binary string of length $10$ and ending with $111 = 2^7 = 128$ (last $3$ positions being fixed)

$\therefore$ The number of binary string not ending with $111  = 1024-128 = 896.$
selected by
Answer:

Related questions

2 votes
2 votes
1 answer
1
gatecse asked Jun 28, 2020
202 views
The minimum number of people that must be in a room to ensure that at least three were born on the same day of the week is $\_\_\_\_\_$
4 votes
4 votes
1 answer
2
gatecse asked Jun 28, 2020
290 views
Consider a set $A$ with $6$ elements. Let $N_1$ denote the number of bijective functions from $A$ to $A$ and let $N_2$ denote the number of onto (surjective) functions fr...
7 votes
7 votes
1 answer
3
gatecse asked Jun 28, 2020
390 views
The number of bit strings of length $6$ that do not contain “$1111$” as a substring is $\_\_\_\_$
4 votes
4 votes
1 answer
4
gatecse asked Jun 28, 2020
206 views
The number of positive integers less than $1000$ which are divisible by $7$ but not by $11$ is $\_\_\_\_$