Answer:
8358.7
Step-by-step explanation:
I think. I need someone to verify
Step-by-step explanation:
= 5 • ( 4• x )
= 5 ( 4x )
= 20x
Answer:
5.13
Step-by-step explanation:
Look at the number at the end, and if it's 5 or more, round up. the 6 is greater than or equal to 5, so you round up, dropping the six and making the 2 into a 3, giving you 5.13.
Answer:
0.082 = 8.2× 10^-2
Step-by-step explanation:
Given the decimal number 0.082, the expanded form using the power of 10 can be gotten by writing the decimal number in standard format(writing as a multiple of 10).
To do that we will shift the decimal point to the front up to the front of digit 8. This shows that the decimal point will be shifted 2times to the front. Since of is shifted 2times to the front, our power of 10 will be -2.
0.082 = 8.2× 10^-2
This gives the required answer.
Note that, the power of 10 is positive when decimals are shifted to the back and negative when shifted to the front(in this case).
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 #)
