<span>704,620 I think this is how it is!
Hope I helped!
</span>
Assuming a d-heap means the order of the tree representing the heap is d.
Most of the computer applications use binary trees, so they are 2-heaps.
A heap is a complete tree where each level is filled (complete) except the last one (leaves) which may or may not be filled.
The height of the heap is the number of levels. Hence the height of a binary tree is Ceiling(log_2(n)), for example, for 48 elements, log_2(48)=5.58.
Ceiling(5.58)=6. Thus a binary tree of 6 levels contains from 2^5+1=33 to 2^6=64 elements, and 48 is one of the possibilities. So the height of a binary-heap with 48 elements is 6.
Similarly, for a d-heap, the height is ceiling(log_d(n)).
2730
You can get this by multiplying the 3 numbers together
Question 1:
For this case we must rewrite the following equation:
If we add 3x to both sides of the equation we have:
Thus, we have that an equivalent expression is option C.
Answer:
Option C
Question 2:
For this case we must solve the following equation:
Subtracting 5 from both sides of the equation we have:
Dividing between -5 on both sides of the equation we have:
Answer:
Option B
First, you want to establish your equations.
L=7W-2
P=60
This is what we already know. To find the width, we have to plug in what we know into P=2(L+W), our equation to find perimeter.
<span>60=2(7W-2+W) </span>
<span>Now that we only have 1 variable, we can solve. </span>
First, distribute the 2.
60=14W-4+2W
Next, combine like terms.
60=16W-4
Then, add four to both sides.
64=16W
Lastly, divide both sides by 16
W=4
To find the length, we plug in our width.
7W-2
7(4)-2
28-2
<span>L=26</span>
