# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

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

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

d-heap is similar to that of a?

binary heap | |

fibonacci heap | |

leftist heap | |

treap |

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 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

d-heap is shallower than a binary heap.

true | |

false |

Question 2 Explanation:

d-heap is much shallower than a binary heap with respect to performance efficiency of insert and delete operations.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which operation cannot be directly performed in a d-heap?

insert | |

delete | |

find | |

create |

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 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which operation is not efficiently performed in a d-heap?

insert | |

delete | |

find | |

merge |

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 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is the run time efficiency of an insertion algorithm in d-heap?

O(N) | |

O(log N) | |

O(log _{d} N) | |

O(N ^{d}) |

Question 5 Explanation:

The run time efficiency of an insertion algorithm in a d-heap is found to be O(log

_{d}N) where d is the number of children. There are 5 questions to complete.