Log In
1 vote

If a random coin is tossed 11 times then what is the probability that for 7th toss head appears exactly 4 times?

A) 5/32

B) 15/128

C) 35/128

D) None of the options

in Probability 450 views

2 Answers

4 votes
Best answer

For $7^{th}$ toss head appears exactly $4$ times means in the previous $6$  tosses head can appear at any position but exactly thrice and the $7^{th}$ toss will result in a head.

Required probability  $= \binom{6}{3}\left ( \frac{1}{2} \right )^{3}\left ( \frac{1}{2} \right )^{3}\left ( \frac{1}{2} \right )$  $= \frac{5}{32}$             

$A$ is correct.

selected by
What about the tosses done from 8,9,10,11 do we need to ignore them ? if to ignore why so ?
yes it is redundant information, here we're more concerned about the 7th toss, it might even be possible that coin is tossed infinite times
Thanks got it .
Official answer is C for this question.
1 vote
→ To find probability that for the 7th toss head appears exactly 4 times. We have find that past 6 run of tosses.
→ Past 6 tosses, What happen we don’t know. But according to 7th toss, we will find that head appeared for 3 times.
→ Any coin probability of a head=½ and probability of a tail=½
→ If we treat tossing of head as success,then this leads to a case of binomial distribution.
→ According to binomial distribution, the probability that in 6 trials we get 3 success is
6C3*(½)3 *(½)3= 5/16 (3 success in 6 trials can happen in 6C3 ways). → 7th toss, The probability of obtaining a head=1/2
→ In given question is not mention that what happens after 7 tosses.
→ Probability for that for 7th toss head appears exactly 4 times is =(5/16)*(1/2)

Related questions

0 votes
4 answers
When we use slow start algorithm ,the size of CW increases ...............until it reaches threshold. A)Additively B)Multiplicatively C)Exponentially D) NONE
asked Dec 25, 2017 in Computer Networks mohitbawankar 192 views
0 votes
2 answers
Demerits of fragmentation A)Complex Routers B) Open to DOS attack C)No overlapping of fragments D) Both A) and B)
asked Dec 25, 2017 in Operating System mohitbawankar 403 views
2 votes
1 answer
The automaton which allows transformation to a new state without consuming any input symbol: a) NFA b) DFA c) NFA-l d) All of the mentioned.
asked Dec 24, 2017 in Theory of Computation mohitbawankar 539 views
0 votes
1 answer
The excess $3$ code is also called cyclic redundancy code weighted code self complimenting code algebraic code
asked Apr 2 in Others Lakshman Patel RJIT 31 views