Probability of Bit Strings with 1 and 00 Endings: A 10-bit Analysis

  • Thread starter Thread starter cahiersujet
  • Start date Start date
  • Tags Tags
    Bits Probability
Click For Summary

Homework Help Overview

The problem involves calculating the probability that a randomly generated bit string of length 10 begins with a 1 or ends with 00, given that the probability of a bit being 0 is 0.4. The subject area pertains to probability theory and combinatorial analysis of bit strings.

Discussion Character

  • Exploratory, Assumption checking

Approaches and Questions Raised

  • Some participants explore the idea of calculating the probability of the string not beginning with 1 or not ending with 00 as an alternative approach.
  • Others suggest that the events of beginning with a 1 and ending with 00 may be independent, prompting a breakdown of the overall probability into simpler components.
  • Questions arise regarding the counting of bit strings that meet the specified conditions.

Discussion Status

Participants have shared various approaches and insights, with some providing foundational probabilities and others questioning the independence of the events. There is a mix of interpretations regarding the calculations involved, and while some guidance has been offered, no consensus has been reached.

Contextual Notes

There is an emphasis on the number of bits in the string, with some participants noting that the length may not affect the probability calculations if the specific values of the bits are not considered.

cahiersujet
Messages
5
Reaction score
0

Homework Statement


Find the probability that a randomly generated bit string of length 10 begins
with a 1 or ends with 00 if the probability that a bit is a 0 is 0.4.


Homework Equations





The Attempt at a Solution


The probability that a bit is a 0 is 0.4 and that a bit is a 1 is 0.6.
1 - - - - - - - 0 0
I'm not sure how to move on?
 
Physics news on Phys.org


In this case, it's easier to compute the probability that the bit string will neither begin with 1 nor end with two 0s.
 


Your probability is P(bit string begins with a 1 OR bit string ends with 00). Seems to me that these are independent events, so you can break this probability into the sum of two probabilities, P(bit string begins with a 1) + P(bit string ends with 00).

Hopefully you can just do some fairly simple counting to come up with the two probabilities. For the first one, how many of the 2^10 bit strings start with a 1? For the second one, how many of the 2^10 bit strings end with 00?
 


The other posts give a pretty good start.
Here's a complete solution, for posterity's sake:

The probability that the first digit is a 1 is $latex P_1 = 0.6$.
The probability the the last two digits are 00 is $latex P_{00} = (0.4)^2$.

The probability that the string either begins with a 1 or ends with 00 is given by $latex P_1 + P_{00} - P_1 P_{00} = 0.664$. (That's the probability that you get a 1 in the beginning, plus a probability that you get 00 in the end, minus the probability that both happens. The subtraction at the end avoids double-counting the possibility of both happening).

You'll notice that we never used the number of digits in the string. That's because if we don't care what values they take, then it doesn't matter. The problem would be the same for a 3-digit string.
 


Oops! Here it is, sans formatting errors:

The probability that the first digit is a 1 is [tex]P_1 = 0.6[/tex].
The probability the the last two digits are 00 is [tex]P_{00} = (0.4)^2[/tex].

The probability that the string either begins with a 1 or ends with 00 is given by [tex]P_1 + P_{00} - P_1 P_{00} = 0.664[/tex]. (That's the probability that you get a 1 in the beginning, plus a probability that you get 00 in the end, minus the probability that both happens. The subtraction at the end avoids double-counting the possibility of both happening).

You'll notice that we never used the number of digits in the string. That's because if we don't care what values they take, then it doesn't matter. The problem would be the same for a 3-digit string.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
3
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
Replies
2
Views
2K
Replies
3
Views
1K
  • · Replies 3 ·
Replies
3
Views
5K