We have the best collection of D-ary Heap (Data Structure) MCQs and answer with FREE PDF. These D-ary Heap (Data Structure) MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## D-ary Heap (Data Structure) MCQs

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

a) insert

b) delete

c) find

d) merge

**Answer: **merge

**2. 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)

**Answer: **O(logd N)

**3. How many comparisons will occur while performing a delete-min operation?**

a) d

b) d-1

c) d+1

d) 1

**Answer: **d-1

**4. How many basic operations can be performed in a d-heap?**

a) 1

b) 2

c) 3

d) 4

**Answer: **2

**5. What is the run time efficiency of delete-min operation?**

a) O(log N)

b) O(logd N)

c) O(d logd N)

d) O(d)

**Answer: **O(d logd N)

**6. Multiplication and division to find children and parents cannot be implemented in a d-heap.**

a) true

b) false

**Answer: **false

**7. How many secondary operations are performed in a d-heap?**

a) 1

b) 2

c) 3

d) 4

**Answer: **4

**8. On which data structure is a d-ary heap based?**

a) stack

b) queue

c) linked list

d) priority queue

**Answer: **priority queue

**9. d-heap is similar to that of a?**

a) binary heap

b) fibonacci heap

c) leftist heap

d) treap

**Answer: **binary heap

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

a) insert

b) delete

c) find

d) create

**Answer: **find

Really helpful to crack MCA

keep reading bro