Am I correct on the first three? And I am not sure about the last option... Sele

Question

Am I correct on the first three? And I am not sure about the last option...

Select all the statements below which are TRUE. Let A[Ln] be a max-heap. Then the first order statistic is A[1] Let All.n] be a max-heap. Then the minimum value in the heap is in the subarray A[PARENT(n)+1 n]. Counting sort is stable. Quick sort runs very fast in practice. Consider a decision tree T with height h 3 corresponding to comparison sort of n elements. Then the number of leaves can be 9 If f(n)-Q(g(n)), then f(n)-ulg(n)).

Explanation / Answer

TRUE [A] First order static is A[1]

TRUE [B] subarray A[parent(n)+1...n]

TRUE [C] Counting sort [ based on keys between a specific range and stable sort i.e., multiple keys with the same value are placed in the sorted array in the same order that they appear in the input array.]

FALSE [D] It depends upon things .

FALSE [E] [it can varry]A binary tree of height h has at most 2^h leaves.
h = 3 leaves => 2^3 = 8

FALSE [F]

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.