## Heap

#### Quiz-summary

0 of 10 questions completed

Questions:

- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10

#### Information

Heap

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading...

You must sign in or sign up to start the quiz.

You have to finish following quiz, to start this quiz:

#### Results

0 of 10 questions answered correctly

Your time:

Time has elapsed

You have reached 0 of 0 points, (0)

#### Categories

- Not categorized 0%

- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10

- Answered
- Review

- Question 1 of 10
##### 1. Question

What is the time complexity of Build Heap operation. Build Heap is used to build a max(or min) binary heap from a given array. Build Heap is used in Heap Sort as a first step for sorting.

CorrectIncorrect - Question 2 of 10
##### 2. Question

Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap? (GATE CS 2009)

CorrectIncorrect - Question 3 of 10
##### 3. Question

We have a binary heap on n elements and wish to insert n more elements (not necessarily one after another) into this heap. The total time required for this is (A) \theta(logn) (B) \theta(n) (C) \theta(nlogn) (D) \theta(n^2)

CorrectIncorrect - Question 4 of 10
##### 4. Question

Given two max heaps of size n each, what is the minimum possible time complexity to make a one max-heap of size from elements of two max heaps?

CorrectIncorrect - Question 5 of 10
##### 5. Question

Which of the following Binary Min Heap operation has the highest time complexity?

CorrectIncorrect - Question 6 of 10
##### 6. Question

Consider a max heap, represented by the array: 40, 30, 20, 10, 15, 16, 17, 8, 4. Now consider that a value 35 is inserted into this heap. After insertion, the new heap is

CorrectIncorrect - Question 7 of 10
##### 7. Question

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:

CorrectIncorrect - Question 8 of 10
##### 8. Question

In a binary max heap containing n numbers, the smallest element can be found in time (GATE CS 2006)

CorrectIncorrect - Question 9 of 10
##### 9. Question

In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time a) \theta(n log n) b) \theta(n) c) \theta(log n) d) \theta(1)

CorrectIncorrect - Question 10 of 10
##### 10. Question

What is the content of the array after two delete operations on the correct answer to the previous question?

CorrectIncorrect