Time Left - 10:00 mins
GATE CS 2018 - Data Structures Quiz 6
Attempt now to get your rank among 813 students!
Question 1
Consider a binary max-heap implemented using an array.
Which one of the following array represents a binary max-heap ?
Which one of the following array represents a binary max-heap ?
Question 2
A max-heap is a heap where the value of each parent is greater than or equal to the value of its children.
Which of the following is a max-heap?
Which of the following is a max-heap?
Question 3
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
Question 4
A data structure is required for storing a set of integers such that each of the following operations can be done in O(log n) time, where n is the number of elements in the set.
I. Deletion of the smallest element
II. Insertion of an element if it is not already present in the set
Which of the following data structures can be used for this purpose?
I. Deletion of the smallest element
II. Insertion of an element if it is not already present in the set
Which of the following data structures can be used for this purpose?
Question 5
The elements 32, 15, 20, 30, 12, 25, 16, are inserted one by one in the given order into a maxHeap. The resultant maxHeap is
- 813 attempts
- 4 upvotes
- 24 comments
Jun 25GATE & PSU CS
