Question 3
Question 4
Question 5
A data structure is required for storing a set of integers such that each of the following operations can be done in (log n) time, where n is the number of elements in the set.
o Deletion of the smallest element o 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 6
X: depth first search 1: heap Y: breadth-first search 2: queue Z: sorting 3: stackis (GATE CS 2000):
Question 7
Question 8
Question 9
Question 10
There are 39 questions to complete.