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)).
For 31 you need 6% OF 50 meaning you need to multiply. 50*0.06=3. The answer for 31 is 3.
To find 33 you need to divide 1 by 0.4 to find how much you need to multiply 28 by. 1/0.4= 2.5 then you need to do 2.5*28 which would equal 70. The answer for 33 is 70.
To find 35 you need to notice that it DECREASES in meaning the bigger number (20) would be the denominator of the fraction and 15 would be the numerator. Therefore the fraction would b 15/20 or 75% of 20 would equal out to 15.
What are the options uh??
Answer:
4 units left : subtract 4 from each x coordinate
3 units down : subtract 3 from each y coordinate
Step-by-step explanation:
Answer: A' (-4,0)
Step-by-step explanation:
