DOWNLOAD FREE PDF <<CLICK HERE>>
Data Structure Questions and Answers-Weak Heap
Congratulations - you have completed Data Structure Questions and Answers-Weak Heap.
You scored %%SCORE%% out of %%TOTAL%%.
Your performance has been rated as %%RATING%%
Your answers are highlighted below.
Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |
Choose the correct properties of weak-heap.
Every node has value greater than the value of child node | |
Every right child of node has greater value than parent node | |
Every left child of node has greater value than parent node | |
None of the mentioned |
CLICK HERE FOR ALL SUBJECTS MCQ
Question 1 Explanation:
This is the property of a weak -heap.
Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |
Left child of parent node has value lesser than the parent node.
True | |
False |
CLICK HERE FOR ALL SUBJECTS MCQ
Question 2 Explanation:
Weak heap has no left child.
Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |
What is the other name of weak heap?
Min-heap | |
Max-heap | |
Relaxed -heap | |
Leonardo heap |
CLICK HERE FOR ALL SUBJECTS MCQ
Question 3 Explanation:
Relaxed heap is just another name of weak heap.
Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |
What is the worst case time in searching minimum value in weak -heap?
O(log n) | |
O(n) | |
O(n logn) | |
O(1) |
CLICK HERE FOR ALL SUBJECTS MCQ
Question 4 Explanation:
Weak heap is an array based form that supports the operation of finding minimum in O(1).
Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |
The total comparisons in finding both smallest and largest elements are
2*n +2 | |
n + ((n+1)/2) -2 | |
n+logn | |
n2 |
CLICK HERE FOR ALL SUBJECTS MCQ
Question 5 Explanation:
None.
Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
There are 5 questions to complete.