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{2024-1} &\textbf{2024-2} &\textbf{2023} & \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 0&0&2 &2 &4&2&0&1.67&4
\\\hline\textbf{2 Marks Count} &1&2&3& 1 &1&0&0&1.33&3
\\\hline\textbf{Total Marks} &2&4&8& 4&6&2&\bf{2}&\bf{4.33}&\bf{8}\\\hline
\end{array}}}$$

Filter

Recent questions in DS

19 votes
3 answers
153
GATE CSE 2021 Set 1 | Question: 10
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$? $\Theta(n\log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta (1)$
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$?$\Theta(...
User Avatar
10 votes
3 answers
154
GATE CSE 2021 Set 1 | Question: 21
Consider the following sequence of operations on an empty stack.$\textsf{push}(54);\textsf{push}(52);\textsf{pop}();\textsf{push}(55);\textsf{push}(62);\textsf{s}=\textsf{pop}();$ ... $\textsf{s+q}$ is ___________.
Consider the following sequence of operations on an empty stack.$$\textsf{push}(54);\textsf{push}(52);\textsf{pop}();\textsf{push}(55);\textsf{push}(62);\textsf{s}=\texts...
User Avatar
1 votes
1 answer
156
NIELIT Scientist B 2020 November: 45
The Preorder traversal of a tree given below is: $\text{A B D F E C G I H J K L}$ $\text{A B C D E G H F I J K L}$ $\text{A B E D F C G H I J K L}$ $\text{A B D F E C G I J H K L}$
The Preorder traversal of a tree given below is:$\text{A B D F E C G I H J K L}$$\text{A B C D E G H F I J K L}$$\text{A B E D F C G H I J K L}$$\text{A B D F E C G I J H...
User Avatar
1 votes
1 answer
157
NIELIT Scientific Assistant A 2020 November: 58
A stack can be implemented using queue, but then we need to use atleast : $3$ queues $2$ queues only one queue is sufficient none of the options
A stack can be implemented using queue, but then we need to use atleast :$3$ queues$2$ queuesonly one queue is sufficientnone of the options
User Avatar
1 votes
1 answer
158
NIELIT Scientific Assistant A 2020 November: 93
When we perform in order traversal on a binary tree, we get the ascending order array. The tree is: Heap tree almost complete binary tree Binary search tree Cannot be determined
When we perform in order traversal on a binary tree, we get the ascending order array. The tree is:Heap treealmost complete binary treeBinary search treeCannot be determi...
User Avatar
1 votes
1 answer
160
NIELIT Scientific Assistant A 2020 November: 114
Priority queue is implemented by : Doubly link list Graph Heap Stack
Priority queue is implemented by :Doubly link listGraphHeapStack
User Avatar
1 votes
1 answer
161
NIELIT Scientific Assistant A 2020 November: 115
A recursive problem like tower of hanoi can be rewritten without recursion using: stack priority queue graph cycles
A recursive problem like tower of hanoi can be rewritten without recursion using:stackpriority queuegraphcycles
User Avatar
3 votes
3 answers
163
UGC NET CSE | October 2020 | Part 2 | Question: 24
In a binary max heap containing $n$ numbers, the smallest element can be found in ______ $O(n)$ $O(\log _2 n)$ $O(1)$ $O(\log_2 \log_2 n)$
In a binary max heap containing $n$ numbers, the smallest element can be found in ______$O(n)$$O(\log _2 n)$$O(1)$$O(\log_2 \log_2 n)$
User Avatar
1 votes
2 answers
165
UGC NET CSE | October 2020 | Part 2 | Question: 64
Match $\text{List I}$ with $\text{List II}$ Let $R_1=\{(1,1), (2,2), (3,3)\}$ and $R_2=\{(1,1), (1,2), (1,3), (1,4)\}$ ... $A-I, B-II, C-IV, D-III$ $A-I, B-IV, C-III, D-II$ $A-I, B-III, C-II, D-IV$ $A-I, B-IV, C-II, D-III$
Match $\text{List I}$ with $\text{List II}$Let $R_1=\{(1,1), (2,2), (3,3)\}$ and $R_2=\{(1,1), (1,2), (1,3), (1,4)\}$$\begin{array}{llll} & \text{List I} & & \text{List I...
User Avatar
2 votes
2 answers
167
NIELIT 2016 MAR Scientist C - Section C: 31
A full binary tree with $n$ non-leaf nodes contains $\log_ 2 n$ nodes $n+1$ nodes $2n$ nodes $2n+1$ nodes
A full binary tree with $n$ non-leaf nodes contains$\log_ 2 n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes
User Avatar
1 votes
1 answer
168
NIELIT 2016 MAR Scientist C - Section C: 49
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is$\Theta (\lo...
User Avatar
Page: