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

Questions without answers in DS

0 votes
0 answers
1
Memory Based GATE DA 2024 | Question: 55
Data Structure question: Binary tree question having four options involving no of internal nodes, leaf nodes, height etc.
Data Structure question: Binary tree question having four options involving no of internal nodes, leaf nodes, height etc.
User Avatar
0 votes
0 answers
3
ISRO 2024
In Reeverse Polish notation, expression A*B+C*D is written as AB*CD*+ A*BCD*+ AB*CD+* A*B*CD+ A request to the approver.!! This question is asked in ISRO 2024. Due to insufficient points, couldn’t add ‘isro2024’ tag, Please add it.
In Reeverse Polish notation, expression A*B+C*D is written asAB*CD*+A*BCD*+AB*CD+*A*B*CD+A request to the approver.!!This question is asked in ISRO 2024. Due to insuffici...
User Avatar
0 votes
0 answers
4
Ace test series
What is the smallest and largest number of entries for 2-3 BTree (B2-3 Tree) of height 8 (i.e., 8 levels) ? 255 and 6560 127 and 2186 6561 and 255 255 and 2186
What is the smallest and largest number of entries for 2-3 BTree (B2-3 Tree) of height 8 (i.e., 8 levels) ?255 and 6560127 and 2186 6561 and 255255 and 2186
User Avatar
0 votes
0 answers
5
testbook question
The total number of binary trees possible with height n - 2 having n nodes are? (2n - 5)^ 2n - 3 (2n - 7)^2n - 3 (n - 3) ^2n - 2 (2n - 7)^ 2n - 2
The total number of binary trees possible with height n - 2 having n nodes are?(2n - 5)^ 2n - 3 (2n - 7)^2n - 3(n - 3) ^2n - 2(2n - 7)^ 2n - 2
User Avatar
0 votes
0 answers
7
Tree
User Avatar
1 votes
0 answers
8
DRDO CSE 2022 Paper 1 | Question: 26 (a)
Provide the correct data structures for the following: ________ is used for delimiter checking and recursion.
Provide the correct data structures for the following:________ is used for delimiter checking and recursion.
User Avatar
1 votes
0 answers
9
DRDO CSE 2022 Paper 1 | Question: 30
If the prefix traversal order of a tree is $*+\mathbf{a} \mathbf{b}-\mathbf{c} \mathbf{d}$. Then, find the equivalent postfix order of the that tree.
If the prefix traversal order of a tree is $*+\mathbf{a} \mathbf{b}-\mathbf{c} \mathbf{d}$. Then, find the equivalent postfix order of the that tree.
User Avatar
1 votes
0 answers
11
Ace Academy Test Series Qn#7
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
User Avatar
0 votes
0 answers
12
Data Structure
Not able to understand the last option.
Not able to understand the last option.
User Avatar
0 votes
0 answers
15
Self Doubt - BFT Applications
Can we use BFT for finding no. of connected components in a directed as well as undirected graph?
Can we use BFT for finding no. of connected components in a directed as well as undirected graph?
User Avatar
0 votes
0 answers
16
Self Doubt
problem : You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Q.here i am not understanding why these problem is following fibonacci series??
problem : You are climbing a staircase. It takes n steps to reach the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?...
User Avatar
0 votes
0 answers
17
NPTEL Assignment of Hashing Techniques
Canadian postal codes have the format LDL DLD, where L is always a letter (between A-Z), D is always a digit (0-9), and is always a single space. For example, the postal code for the University of Waterloo is N2L 3G1. Devise a suitable hash function for this system.
Canadian postal codes have the format LDL DLD, where L is always a letter (between A-Z), D is always a digit (0-9), and is always a single space. For example, the postal ...
User Avatar
0 votes
0 answers
18
Testbook Test Series
User Avatar
0 votes
0 answers
19
Testbook Test Series
User Avatar
0 votes
0 answers
20
made easy
Given AVL tree is originally balanced. If a node is added to T1 so that height T1 becomes h+1 from h and z is the first node which is now imbalanced, Then find the height of T3? h h+1 h+2 h+3 Please someone explain the solution.
Given AVL tree is originally balanced. If a node is added to T1 so that height T1 becomes h+1 from h and z is the first node which is now imbalanced, Then find the height...
User Avatar
1 votes
0 answers
21
NIELIT STA 2021
If a hash table is implemented asa search tree, the expected time required to enter n names and make m searches is proportional to: (n + m) $log_{2} n$ (n + m) $log_{2} m$ mn $log_{2} n$ mn $log_{2} m$
If a hash table is implemented asa search tree, the expected time required to enter n names and make m searches is proportional to: (n + m) $log_{2} n$(n + m) $log_{2} m$...
User Avatar
1 votes
0 answers
26
Allen Career Institute:Circular Queue
$1)$How circular queue can be implemented? $2)$ For which data structure circular queue cannot be implemented? $(A)$Array $(B)$ Singly Linked List $(C)$ Doubly Linked List $(D)$ Stack
$1)$How circular queue can be implemented?$2)$ For which data structure circular queue cannot be implemented?$(A)$Array $(B)$ Singly Linked List $(C)$ Doubly Linked List...
User Avatar
To see more, click for the full list of questions or popular tags.