Data Structure Questions and Answers-Weak Heap

 

 Help authour, Buy PDF Ebook   >>>Click Here<<<

Data Structure Questions and Answers-Weak Heap

Question 1
Choose the correct properties of weak-heap.
A
Every node has value greater than the value of child node
B
Every right child of node has greater value than parent node
C
Every left child of node has greater value than parent node
D
None of the mentioned
Puzzles Questions answers
Question 1 Explanation: 
This is the property of a weak -heap.

Question 2
Left child of parent node has value lesser than the parent node.
A
True
B
False
Reading comprehension Questions answers
Question 2 Explanation: 
Weak heap has no left child.

Question 3
What is the other name of weak heap?
A
Min-heap
B
Max-heap
C
Relaxed -heap
D
Leonardo heap
Microbiology Questions answers
Question 3 Explanation: 
Relaxed heap is just another name of weak heap.

Question 4
What is the worst case time in searching minimum value in weak -heap?
A
O(log n)
B
O(n)
C
O(n logn)
D
O(1)
English grammar Questions answers
Question 4 Explanation: 
Weak heap is an array based form that supports the operation of finding minimum in O(1).

Question 5
The total comparisons in finding both smallest and largest elements are
A
2*n +2
B
n + ((n+1)/2) -2
C
n+logn
D
n2
Journalism Questions answers
Question 5 Explanation: 
None.

There are 5 questions to complete.

 

 Help authour, Buy PDF Ebook   >>>Click Here<<<