Data Structure I Mock Test 8

10%

Question 1 of 10

1. d-heap is shallower than a binary heap.

true

false

Question 1 of 10

Question 2 of 10

2. Which of the following operations does not destroy the leftist heap property?

delete

merge

swap

insert

Question 2 of 10

Question 3 of 10

3. What is the reason for the efficiency of a pairing heap?

time-efficient

simplicity

advanced

space-efficient

Question 3 of 10

Question 4 of 10

4. Which of the following is difficult to determine the right path length?

Binomial tree

Skew heaps

Leftist heap

d-heap

Question 4 of 10

Question 5 of 10

5. What are the siblings of smallest element of the given maximum ternary heap?

Question 5 of 10

Question 6 of 10

6. In a binary min heap containing n elements, the largest element can be found in __________ time.

O(nlogn)

O(1)

O(n)

O(logn)

Question 6 of 10

Question 7 of 10

7. Should leaves in ternary heap be distributed from left to right.

False

True

Question 7 of 10

Question 8 of 10

8. The worst case analysis for a naïve merge is given as?

O(N)

O( N log N)

O(N²)

O( log N)

Question 8 of 10

Question 9 of 10

9. The actual pairing heap implementation uses the right child and left child representation.

true

false

Question 9 of 10

Question 10 of 10

10. What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree?

Cubic Time

Linear Time

Exponential Time

Logarithmic Time

Question 10 of 10