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
2 answers
1382
Post order traversal
Post order traversal of a BST is 35,50,55,60,50,100.then what can you say about the tree? (A) Min heap (B) Max heap (C) Strict binary tree (D) None of these
Post order traversal of a BST is 35,50,55,60,50,100.then what can you say about the tree?(A) Min heap(B) Max heap(C) Strict binary tree(D) None of these
User Avatar
14 votes
2 answers
1383
ISI2014-PCB-CS-2b
Let $H_1$ and $H_2$ be two complete binary trees that are heaps as well. Assume $H_1$ and $H_2$ are max-heaps, each of size $n$. Design and analyze an efficient algorithm to merge $H_1$ and $H_2$ to a new max-heap $H$ of size $2n$.
Let $H_1$ and $H_2$ be two complete binary trees that are heaps as well. Assume $H_1$ and $H_2$ are max-heaps, each of size $n$. Design and analyze an efficient algorithm...
User Avatar
7 votes
4 answers
1386
number of ordered trees
The number of possible ordered trees with 3 nodes A, B, C is: (a) 16 (b) 12 (c) 6 (d) 10 what is ordered tree alignment?
The number of possible ordered trees with 3 nodes A, B, C is:(a) 16 (b) 12 (c) 6 (d) 10 what is ordered tree alignment?
User Avatar
0 votes
1 answer
1387
Pointers Question
Pointers in C-programming are useful to 1.Handle data tables efficiently. 2.Reduce the length of a program. 3.Reduce the complexity of a program. Which of the above statements are correct? a) 1 and 2 only b) 1,2 and 3 c) 2 and 3 only d) 1 and 3 only
Pointers in C-programming are useful to1.Handle data tables efficiently.2.Reduce the length of a program.3.Reduce the complexity of a program.Which of the above statement...
User Avatar
2 votes
1 answer
1388
Minimum number of nodes in a full binary tree with height 3?
User Avatar
0 votes
1 answer
1392
Algo
Consider an array size of 10 and insertion of 10 element in it.If first five element are inserted at loc =0 and rest five element are at loc=2 then the total number of shifting of elements is: 35 20 45 0
Consider an array size of 10 and insertion of 10 element in it.If first five element are inserted at loc =0 and rest five element are at loc=2then the total number of shi...
User Avatar
0 votes
1 answer
1395
introduction to algorithm 6.2.3 exercise question
$6.2-3$ What is the effect of calling MAX-HEAPIFY(A,i) when the element A[i] is larger that its children?
$6.2-3$What is the effect of calling MAX-HEAPIFY(A,i) when the element A[i] is larger that its children?
User Avatar
1 votes
2 answers
1396
Breadth First Search
Option (c) ------- QMNPRO is correct.....what does this traversal convey ?? .....If it conveys " the shortest path from Q to every vertex in graph ", then how can we explain it ???
Option (c) - QMNPRO is correct.....what does this traversal convey ?? .....If it conveys " the shortest path from Q to every vertex in graph ", then how can we ex...
User Avatar
1 votes
1 answer
1397
UPPCL'13
How many number of add and remove operations are required to access x/2th element of a queue of ‘x’ elements, so that the original queue remains the same after the access is 1) 8*x 2) 4*x-1 3) 4*x 4) 8*x-1
How many number of add and remove operations are required to access x/2th element of a queue of ‘x’ elements, so that the original queue remains the same after the ac...
User Avatar
3 votes
2 answers
1398
ISRO-2013-32
Which of the following number of nodes can form a full binary tree? 8 15 14 13
Which of the following number of nodes can form a full binary tree?8151413
User Avatar
1 votes
1 answer
1399
Facts about AVL tree
Which of the following is false? A. Maximum height of an AVL tree of n nodes is 1.44 log2n ​B. Insertion of an element into an AVL tree requires at most a double rotation C. Deletion of an element may require O(log n) rotation D. None of these
Which of the following is false?A. Maximum height of an AVL tree of n nodes is 1.44 log2n​B. Insertion of an element into an AVL tree requires at most a double rot...
User Avatar
Page: