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

10 votes
5 answers
1442
MadeEasy Test Series: Programming & DS - Binary Tree
The number of ways we can insert elements { 1, 2, 3, .... 7 } to make an AVL tree, so that it does not have any rotation are _______ ?
The number of ways we can insert elements { 1, 2, 3, .... 7 } to make an AVL tree, so that it does not have any rotation are _______ ?
User Avatar
4 votes
1 answer
1443
What's the difference between Binary tree height, level and depth?
What's the difference between Binary tree height, level and depth? Sometimes it's confusing! Does there definition change according to question also, if mentioned?
What's the difference between Binary tree height, level and depth? Sometimes it's confusing!Does there definition change according to question also, if mentioned?
User Avatar
1 votes
1 answer
1444
Find out the topological ordering of the given graph
User Avatar
2 votes
1 answer
1445
binary search tree
Given numbers from 1 to 8 ,number 5 is in the root of binary search tree.how many such binary search tree are possible?
Given numbers from 1 to 8 ,number 5 is in the root of binary search tree.how many such binary search tree are possible?
User Avatar
2 votes
1 answer
1447
worst case possible height of an AVL tree .
What is the worst case possible height of an AVL tree?? a. 2logn (Assume base of log is 2) b. 1.44log n (Assume base of log is 2) c. Depends upon implementation d. Theta(n)
What is the worst case possible height of an AVL tree??a. 2logn (Assume base of log is 2) b. 1.44log n (Assume base of log is 2)c. Depends upon implementationd. Thet...
User Avatar
0 votes
2 answers
1448
Ace Test Series: Programming & DS - Binary Search Trees
I am stuck after JAN. It is not getting balanced even after 2 rotations. Can somebody help?
I am stuck after JAN. It is not getting balanced even after 2 rotations. Can somebody help?
User Avatar
0 votes
1 answer
1449
depth of the binary tree with n node?
User Avatar
1 votes
2 answers
1451
DFS
User Avatar
0 votes
1 answer
1454
data structure
describe in details
describe in details
User Avatar
0 votes
2 answers
1456
Location of element using Row Major Order
My question is : in the row [8][-8] to [8][5] will be 5-(-8)+1 = 14 elements , right ? so , it should be 1060 then considering 4 Byte is one element. I know , this is pretty basic question. But , still got me wrong :)
My question is : in the row [8][-8] to [8][5] will be 5-(-8)+1 = 14 elements , right ? so , it should be 1060 then considering 4 Byte is one element.I know , this is pret...
User Avatar
0 votes
2 answers
1458
MadeEasy Test Series: Programming & DS - Linked Lists
Delete the duplicate node Delete the alternate duplicate node Delete the adjacent node None of these
Delete the duplicate nodeDelete the alternate duplicate nodeDelete the adjacent nodeNone of these
User Avatar
0 votes
1 answer
1460
MadeEasy Test Series 2018: Programming & DS - Binary Tree
Consider the below code which run on any tree. In-order traversal Post-order traversal Pre-order traversal None of these
Consider the below code which run on any tree.In-order traversalPost-order traversalPre-order traversalNone of these
User Avatar
Page: