D-ary Heap Multiple choice Questions and Answers (MCQs)

 

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

D-ary Heap Multiple choice Questions and Answers (MCQs)

Question 1
d-heap is similar to that of a?
A
binary heap
B
fibonacci heap
C
leftist heap
D
treap
English literature Questions answers
Question 1 Explanation: 
A d-heap is similar to that of a binary heap except that binary heaps have two children and d-heaps have d children.

Question 2
d-heap is shallower than a binary heap.
A
true
B
false
Biology Questions answers
Question 2 Explanation: 
d-heap is much shallower than a binary heap with respect to performance efficiency of insert and delete operations.

Question 3
Which operation cannot be directly performed in a d-heap?
A
insert
B
delete
C
find
D
create
Biology Questions answers
Question 3 Explanation: 
Find operation in a d-heap cannot be performed as in other heaps. This is the main weakness of d-heap.

Question 4
Which operation is not efficiently performed in a d-heap?
A
insert
B
delete
C
find
D
merge
English grammar Questions answers
Question 4 Explanation: 
Unlike find operation, which cannot be performed in a d-heap, the task of merging two d-heaps is very difficult.

Question 5
What is the run time efficiency of an insertion algorithm in d-heap?
A
O(N)
B
O(log N)
C
O(logd N)
D
O(Nd)
Public administration Questions answers
Question 5 Explanation: 
The run time efficiency of an insertion algorithm in a d-heap is found to be O(logd N) where d is the number of children.

There are 5 questions to complete.

 

 Download all FREE PDF Ebook >>>CLICK HERE<<<