Study hard and take the test slowly. rushing will make you get all the wuestions wrong. if you need more advice, message me.
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)).
take 16+5=21. 29-21=8 so answer is 8
Answer is in the attached file...
Answer:
Value of h greater than 5.4 will make inequality false.
Step-by-step explanation:
This question is incomplete; here is the complete question.
The Jones family has saved a maximum of $750 for their family vacation to the beach. While planning the trip, they determine that the hotel will average $125 a night and tickets for scuba diving are $75. The inequality can be used to determine the number of nights the Jones family could spend at the hotel 750 ≥ 75 + 125h. What value of h does NOT make the inequality true?
From the given question,
Per night expense (expected) = $125
If Jones family stays in the hotel for 'h' days then total expenditure on stay = $125h
Charges for scuba diving = $75
Total charges for stay and scuba diving = $(125h + 75)
Since Jones family has saved $750 for the vacation trip so inequality representing the expenses will be,
125h + 75 ≤ 750
125h ≤ 675
h ≤ 
h ≤ 5.4
That means number of days for stay should be less than equal to 5.4
and any value of h greater than 5.4 will make the inequality false.