GATE CSE
First time here? Checkout the FAQ!
x
+3 votes
298 views

A random bit string of length n is constructed by tossing a fair coin n times and setting a bit to 0 or 1 depending on outcomes head and tail, respectively. The probability that two such randomly generated strings are not identical is:

  1. $\frac{1}{2^n}$
  2. $1 - \frac{1}{n}$
  3. $\frac{1}{n!}$
  4. $1 - \frac{1}{2^n}$
asked in Probability by Veteran (12.6k points)   | 298 views

Total possible selections ((2n)C1 ) * ((2n)C1 ) . Favorable outcomes   (2n) * (2n-1)

2 Answers

+8 votes
Best answer

answer - D

suppose there are k places within n bit string where mismatch has occoured

probability of this occouring is nCk(prob. of mismatch)k(prob. of match)(n - k) = nCk(1/2)k(1/2)(n-k) = nCk(1/2)n

k can range from 1 to n hence required probability sum(nCk(1/2)n) where k ranges from 1 to n

hence (1/2n)(2n - 1)


Alternatively

Probability of matching at given place 1/2

there are n places hence probability of matching 1/(2n)

hence probability of mismatch 1 - 1/(2n)
 

answered by Boss (9k points)  
selected by
–1 vote
Favourable case is 1 and the total sample space is $2^n$ so it must be $1/2^n$
answered by Veteran (12.8k points)  
Read the question once ! Answer should be D .
Top Users Jan 2017
  1. Debashish Deka

    8608 Points

  2. sudsho

    5398 Points

  3. Habibkhan

    4718 Points

  4. Bikram

    4522 Points

  5. Vijay Thakur

    4468 Points

  6. saurabh rai

    4222 Points

  7. Arjun

    4122 Points

  8. santhoshdevulapally

    3742 Points

  9. Sushant Gokhale

    3576 Points

  10. GateSet

    3394 Points

Monthly Topper: Rs. 500 gift card

19,177 questions
24,073 answers
52,975 comments
20,310 users