Question

In: Statistics and Probability

Of all bit sequences of length 8, an 8-bit sequence is selected at random. Assuming that...

Of all bit sequences of length 8, an 8-bit sequence is selected at random.
Assuming that the probability of a bit being 0 is equal to that being 1, determine
the probability that the selected bit sequence starts with a 1 or ends with the two
bits 00.

Solutions

Expert Solution

From the question , we can see that the event is either getting a 8 digit number starting with 1 or ending with 00.

So , sample space is 28 as there are 8 places and we can put either 1 or 0 there , so sample space is 256 or we can say we have 256 equally likely outcomes.

Now , according to event , first space is 1 so similarly we have 27 equally likely outcomes with first space as 1 , so we have 128 outcomes.

We can even have two zeros at last , so for that we have 26 possibilities or 64 outcomes.

So total outcomes for events are 128+64 = 192

Now there must be some numbers which start with 1 and end with 00 , so we must remove them once as there are added twice in our 192 outcomes we got . So, we have fixed 3 places first one with 1 and last two with 0 , so we have 24 = 32 ways . So we finally get 192-32 ways = 160 ways .

So P(E) = Total no. Of outcomes for event / total no. Of outcomes (Sample Space)

So , P(E) =

=  


Related Solutions

How many bit strings of length 8 if i. bit strings start with the bit 1;...
How many bit strings of length 8 if i. bit strings start with the bit 1; ii. bit strings end with the two bits 00; iii. bit strings either start with the bit 1 or end with the bits 00.؟
Suppose that you pick a bit string from the set of all bit strings of length...
Suppose that you pick a bit string from the set of all bit strings of length ten. Find the probability that the bit string has exactly two 1s; the bit string begins and ends with 0; the bit string has the sum of its digits equal to seven; the bit string has more 0s than 1s; the bit string has exactly two 1s, given that the string begins with a 1.
Suppose that you pick a bit string from the set of all bit strings of length...
Suppose that you pick a bit string from the set of all bit strings of length ten. Find the probability that the bit string has exactly two 1s; the bit string begins and ends with 0; the bit string has the sum of its digits equal to seven; the bit string has more 0s than 1s; the bit string has exactly two 1s, given that the string begins with a 1.
Write a VHDL code to implement a Finite State Machine that with an 8 bit sequence...
Write a VHDL code to implement a Finite State Machine that with an 8 bit sequence input (can be any sequence, but lets say it is 11001000), determine how many states there are as well; so if the input sequence is correct it will show the number 1 in a 7 segment display, otherwise it will be 0 in the same 7 segment display. If the input sequence is incorrect, start from the beginning.
An n-bit binary string is a sequence of length n over the alphabet {0,1}. How many...
An n-bit binary string is a sequence of length n over the alphabet {0,1}. How many n-bit binary strings are there? How many n-bit binary strings b1,…,bn are there such that b1b2≠00? In other words, how many n-bit binary strings don't begin with 00? How many n-bit binary strings b1,…,bn are there such that b1b2≠00 and b2b3≠11? How many n-bit binary strings b1,…,bn are there such that b1b2≠00 and such that b2b3≠01?
Interpret these signed 8-bit sequences with each type of signed/unsigned encoding. Remember the bits are arbitrary!...
Interpret these signed 8-bit sequences with each type of signed/unsigned encoding. Remember the bits are arbitrary! They can be interpreted in many different ways. C.1: Complete the following table using decimal (base-10) numbers. The first line is already completed for you bit sequence unsigned sign-magnitude 1s’ complement 2’s complement 00000101 +5 +5 +5 +5 11110001 ? ? ? ? 01010011 ? ? ? ? 10000000 ? ? ? ? 11111111 ? ? ? ?
Find sequences that satisfy the following or explain why no such sequence exists: a) A sequence...
Find sequences that satisfy the following or explain why no such sequence exists: a) A sequence with subsequences converging to 1, 2, and 3. b) A sequence that is bounded above, but has no convergent subsequence. c) A sequence that has a convergent subsequence but is unbounded (note: unbounded means not bounded below or not bounded above. d) A sequence that is monotonic and bounded, but does not converge.
In sequences and series what is a sequence and what is a series? Mention some types of sequences?
In sequences and series what is a sequence and what is a series? Mention some types of sequences?
Recall that a 5-bit string is a bit strings of length 5, and a bit string...
Recall that a 5-bit string is a bit strings of length 5, and a bit string of weight 3, say, is one with exactly three 1’s. a. How many 5-bit strings are there? b. How many 5-bit strings have weight 0? c. How many 5-bit strings have weight 1? d. How many 5-bit strings have weight 2? e. How many 5-bit strings have weight 4? f. How many 5-bit strings have weight 5? g. How many 5-bit strings have weight...
Assuming three-bit exponent field and four-bit significand, what is the bit pattern for -8.75
Assuming three-bit exponent field and four-bit significand, what is the bit pattern for -8.75
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT