50 votes
8 answers
126
79 votes
10 answers
127
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time$\Theta (n \log n)$$\Theta (n)$$\Theta(\log n)$$\...
29 votes
3 answers
128
The maximum number of binary trees that can be formed with three unlabeled nodes is:$1$$5$$4$$3$
48 votes
9 answers
130
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a...
5 votes
4 answers
131
This is a question from Operating System concepts by Silberschatz, Gagne and Galvin. On very first go I could make that in such a situation deadlock can never occur. But ...
3 votes
1 answer
132
Response sheet has been released for gate 2018. When will the marks calculator be launched?
59 votes
7 answers
133
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:QueueStackHeapB-Tree
55 votes
8 answers
134
The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above
35 votes
5 answers
139
The number of leaf nodes in a rooted tree of n nodes, with each node having $0$ or $3$ children is:$\frac{n}{2}$$\frac{(n-1)}{3}$$\frac{(n-1)}{2}$$\frac{(2n+1)}{3}$
85 votes
9 answers
140