Register

Webpage

Arrays, Stacks, Queues, Linked lists, Trees, Binary search trees, Binary heaps, Graphs.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 2 &4&2&3&0&2&3&1&1&1&0&1.9&4
\\\hline\textbf{2 Marks Count} & 1 &1&0&2&2&0&0&1&3&3&0&1.3&3
\\\hline\textbf{Total Marks} & 4&6&2&7&4&2&3&3&7&7&\bf{2}&\bf{4.5}&\bf{7}\\\hline
\end{array}}}$$

Filter

Recent questions in DS

62 votes
4 answers
1604
GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is...
User Avatar
35 votes
12 answers
1605
GATE CSE 2015 Set 2 | Question: 10
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.
User Avatar
0 votes
2 answers
1606
For every push pop>3 units time required.
For every push pop>3 units time required. Do continuously 4 push afterward 4 pop. Then what is the average life time of stack.
For every push pop>3 units time required. Do continuously 4 push afterward 4 pop. Then what is the average life time of stack.
User Avatar
11 votes
5 answers
1607
What is the complexity of finding 50th smallest element in an already constructed binary min-heap?
What is the complexity of finding $50^{th}$ smallest element in an already constructed binary min-heap? $\Theta(1)$ $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$
What is the complexity of finding $50^{th}$ smallest element in an already constructed binary min-heap?$\Theta(1)$$\Theta (\log n)$$\Theta (n)$$\Theta (n \log n)$
User Avatar
2 votes
1 answer
1608
Answer the following question
In 28 my answer is c but answer given is d.
In 28 my answer is c but answer given is d.
User Avatar
0 votes
1 answer
1609
Answer the following question
Please show steps for the question 20 and 14.
Please show steps for the question 20 and 14.
User Avatar
6 votes
2 answers
1611
MadeEasy Test Series: Programming & DS - Hashing
Consider a hash table using uniform hashing with number of slots as $m=6$ and number of keys, $k=8$. Collisions are resolved by chaining. Assuming direct hashing is used, what is the expected number of slots that ends not being empty?
Consider a hash table using uniform hashing with number of slots as $m=6$ and number of keys, $k=8$. Collisions are resolved by chaining. Assuming direct hashing is used,...
User Avatar
0 votes
2 answers
1612
Is it option A ?
User Avatar
64 votes
7 answers
1615
GATE IT 2005 | Question: 50
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h > 0$, then the minimum number of nodes in the tree is $2^{h-1}$ $2^{h-1} + 1$ $2^h - 1$ $2^h$
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h 0$, then the m...
User Avatar
53 votes
7 answers
1617
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number...
User Avatar
23 votes
4 answers
1619
GATE IT 2004 | Question: 54
Which one of the following binary trees has its inorder and preorder traversals as $BCAD$ and $ABCD$, respectively?
Which one of the following binary trees has its inorder and preorder traversals as $BCAD$ and $ABCD$, respectively?
User Avatar
Page: