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

0 votes
0 answers
321
Made Easy DS doubt
IS IT CORRECT…??
IS IT CORRECT…??
User Avatar
8 votes
2 answers
322
GATE Overflow | Mock GATE | Test 1 | Question: 13
For a given $m$-ary tree, the relationship between leaf nodes and internal nodes is represented by the graph given below. What is the value of $'m'$? Take necessary approximations to nearest integer if required (Integer type)
For a given $m$-ary tree, the relationship between leaf nodes and internal nodes is represented by the graph given below. What is the value of $'m'$? Take necessary appro...
User Avatar
0 votes
1 answer
325
Testbook Test Series: Programming & DS - Hashing
How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept
How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept
User Avatar
1 votes
1 answer
327
selfdoub
User Avatar
0 votes
2 answers
329
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ? Does it vary for binary tree? What do you mean by internal nodes? Non root node and leaf node?
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?Does it vary for binary tree?What do you mean by internal nodes? Non roo...
User Avatar
1 votes
1 answer
331
Stack
If two stack is growing two opposite end of array. Then which logic works and how?
If two stack is growing two opposite end of array. Then which logic works and how?
User Avatar
0 votes
1 answer
334
MIN HEAP
The time complexity of the most efficient algorithm to determine whether an arbitrary array of size ‘n’, is min-heap or not? (A) O(log n) (B) O(n) (C) O(n logn) (D) O(1)
The time complexity of the most efficient algorithm to determine whether an arbitrary array of size ‘n’, is min-heap or not?(A) O(log n)(B) O(n)(C) O(n logn)(D) O(1)
User Avatar
0 votes
0 answers
335
Priority Queue
Is priority queue work efficiently with sorted array than unsorted array and heap for insertion and deletion operation? Then why do we apply priority queue in heap specially
Is priority queue work efficiently with sorted array than unsorted array and heap for insertion and deletion operation? Then why do we apply priority queue in heap specia...
User Avatar
1 votes
1 answer
337
Deleting a random node from Heap
What is the time complexity of 'deleting any random node from a max or min heap'?
What is the time complexity of 'deleting any random node from a max or min heap'?
User Avatar
0 votes
0 answers
340
Testbook
An array A of unknown size is filled with special symbols let say ‘#’ . Time required to find the size of A is: (A) O(1) (B) O(logn) (C) O(n) (D) O((logn)$^{2}$)
An array A of unknown size is filled with special symbols let say ‘#’ . Time required to find the size of A is:(A) O(1)(B) O(logn)(C) O(n)(D) O((logn)$^{2}$)
User Avatar
Page: