In order to answer the above question, you should know the general rule to solve these questions.
The general rule states that there are 2ⁿ subsets of a set with n number of elements and we can use the logarithmic function to get the required number of bits.
That is:
log₂(2ⁿ) = n number of <span>bits
</span>
a). <span>What is the minimum number of bits required to store each binary string of length 50?
</span>
Answer: In this situation, we have n = 50. Therefore, 2⁵⁰ binary strings of length 50 are there and so it would require:
log₂(2⁵⁰) <span>= 50 bits.
b). </span><span>what is the minimum number of bits required to store each number with 9 base of ten digits?
</span>
Answer: In this situation, we have n = 50. Therefore, 10⁹ numbers with 9 base ten digits are there and so it would require:
log2(109)= 29.89
<span> = 30 bits. (rounded to the nearest whole #)
c). </span><span>what is the minimum number of bits required to store each length 10 fixed-density binary string with 4 ones?
</span>
Answer: There is (10,4) length 10 fixed density binary strings with 4 ones and
so it would require:
log₂(10,4)=log₂(210) = 7.7
= 8 bits. (rounded to the nearest whole #)
Answer:
D. (bottom right)
Step-by-step explanation:
If there is a line where y = x, that means that y and x can both equal 1, 2, 3, -1, -2, -3, etc. They are just always the same. This line, then, would pass through (just for example) (-4, -4) and (4, 4). If you reflect the pink figure across that line, you will get the blue figure. Hope this helps!
Answer:
18
Step-by-step explanation:
Subtract 6 from both sides so the equation becomes 1/9x=2. Multiply by the reciprocal on both sides (9)1/9x=2(9).
This cancels out to x=18
Answer:
6
Step-by-step explanation:
6 is the answer as the outcoming value is 6√2
Answer: probably c
Step-by-step explanation:
i divided it and got 401.063963
