Answer:
90 degrees because A is an acute angle so x equals 45 degrees and so I multiply that by 2
Step-by-step explanation:
Answer:
this answer is 3 for b i got it right
Answer:
it's 100
Step-by-step explanation:
70000
0000
600
80
1
I don't know if you understand
Answer:
The correct option is 1.
Step-by-step explanation:
Given information: The coordinates of a right angled triangle ABC are A(0, 0), B(0, 4a – 5) and C(2a + 1, 2a + 6). Angle ABC = 90°.
It means AB and BC are legs of the right angled triangle ABC.
Side AB lies on the y-axis because the x-coordinate of both A and B is 0.
Two legs are perpendicular to each other. So, BC must be parallel to x-axis and the y-coordinate of both B and C is must be same.



Divide both sides by 2.

The value of a is 2. So the coordinates of triangle ABC are


The area of a triangle is

The area of triangle ABC is





The area of triangle ABC is 102. Therefore the correct option is 1.
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 #)