Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions and answers in DS
1
vote
1
answer
1
DRDO CSE 2022 Paper 1 | Question: 28
If the maximum height of a binary tree is $\mathrm{N},$ then how many number of nodes will there be?
Ajay12345
answered
in
DS
2 days
ago
by
Ajay12345
231
views
drdocse-2022-paper1
data-structures
binary-tree
4-marks
descriptive
1
vote
3
answers
2
UGC NET CSE | December 2004 | Part 2 | Question: 22
Suppose we are implementing quadratic probing with a Hash function, Hash $(y)=X$ mode $100$. If an element with key $4594$ is inserted and the first three locations attempted are already occupied, then the next cell that will be tried is : $2$ $3$ $9$ $97$
ajayraho
answered
in
DS
Mar 11
by
ajayraho
1.6k
views
ugcnetcse-dec2004-paper2
1
vote
1
answer
3
DRDO CSE 2022 Paper 1 | Question: 26 (b)
Provide the correct data structures for the following: Asynchronous data transfer and accessing shared resource involve _________.
mishraamulya
answered
in
DS
Mar 10
by
mishraamulya
318
views
drdocse-2022-paper1
data-structures
1-mark
fill-in-the-blanks
24
votes
2
answers
4
GATE CSE 2006 | Question: 77
Statement for Linked Answer Questions 76 & 77: A $3$-ary max heap is like a binary max heap, but instead of $2$ children, nodes have $3$ children. A $3$-ary heap can be represented by an array as follows: The root is stored in the first location, $a[0]$, nodes in the next level, from left to ... $10, 9, 4, 5, 7, 6, 8, 2, 1, 3$ $10, 8, 6, 9, 7, 2, 3, 4, 1, 5$
Maddy_dahiphale
answered
in
DS
Feb 23
by
Maddy_dahiphale
7.3k
views
gatecse-2006
data-structures
binary-heap
normal
0
votes
2
answers
5
GATE CSE 2024 | Set 1 | Question: 33
Consider a binary min-heap containing $105$ distinct elements. Let $k$ be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values of $k$ is $53$ $52$ $27$ $1$
Swarnava Bose
answered
in
DS
Feb 18
by
Swarnava Bose
1.8k
views
gatecse2024-set1
data-structures
0
votes
1
answer
6
GATE DS&AI 2024 | Question: 11
Consider performing uniform hashing on an open address hash table with load factor $\alpha=\frac{n}{m}<1$, where $n$ elements are stored in the table with $m$ slots. The expected number of probes in an unsuccessful search is at most $\frac{1}{1-\alpha}$. Inserting ... $\frac{1}{1-\alpha}$ $1+\frac{\alpha}{2}$ $\frac{1}{1+\alpha}$
liontig37
answered
in
DS
Feb 18
by
liontig37
650
views
gate-ds-ai-2024
data-structures
hashing
uniform-hashing
1
vote
1
answer
7
GATE CSE 2024 | Set 2 | Question: 38
Let $\mathrm{S} 1$ and $\mathrm{S} 2$ be two stacks. $\mathrm{S} 1$ has capacity of $4$ elements. $\mathrm{S} 2$ has capacity of $2$ elements. $\text{S1}$ already has $4$ elements: $100,200,300$, and $400$ ... output sequences can be generated by using the above operations? $100,200,400,300$ $200,300,400,100$ $400,200,100,300$ $300,200,400,100$
Hira Thakur
answered
in
DS
Feb 17
by
Hira Thakur
1.6k
views
gatecse2024-set2
data-structures
stack
multiple-selects
0
votes
1
answer
8
GATE DS&AI 2024 | Question: 22
The fundamental operations in a double-ended queue $D$ are: insertFirst (e) - Insert a new element $e$ at the beginning of $D$. insertLast (e) - Insert a new element $e$ ... (28) insertLast (17) a $\leftarrow$ removeFirst () $\mathbf{a} \leftarrow$ removeLast () The value of $\mathbf{a}$ is
NarutoUzumaki
answered
in
DS
Feb 17
by
NarutoUzumaki
640
views
gate-ds-ai-2024
numerical-answers
data-structures
2
votes
2
answers
9
Memory Based GATE DA 2024 | Question: 23
Consider a binary tree. Among the following traversal combinations, which of them can uniquely construct the tree? Inorder + Preorder Preorder + Postorder Only Inorder Inorder + Postorder
hacker24
answered
in
DS
Feb 15
by
hacker24
253
views
gate2024-da-memory-based
goclasses
data-structures
binary-tree
tree-traversal
0
votes
1
answer
10
Memory Based GATE DA 2024 | Question: 24
Consider a doubly linked list with the following operations: - Insert First (\texttt{InsertFirst}) \\ - Insert Last (\texttt{InsertLast}) \\ - Remove First (\texttt{RemoveFirst}) \\ - Remove Last (\texttt{RemoveLast}) The following operations are ... \ & a = \text{RemoveLast} \end{aligned} \] What is the value of \(a\) after these operations?
hacker24
answered
in
DS
Feb 15
by
hacker24
151
views
gate2024-da-memory-based
goclasses
data-structures
linked-list
numerical-answers
0
votes
1
answer
11
Memory Based GATE DA 2024 | Question: 40
Match the following: $ \begin{array}{|p{0.3\linewidth}|p{0.6\linewidth}|} \hline \textbf{Technique} & \textbf{Characteristic} \\ \hline FIFO & (ii) Queue \\ \hline Look Up & (i) Hash Table\\ \hline LIFO & (iii) Stack \\ \hline \end{array} $
TusharRana
answered
in
DS
Feb 13
by
TusharRana
148
views
gate2024-da-memory-based
goclasses
data-structures
stack
5
votes
3
answers
12
ISRO2016-30
A complete binary tree with $n$ non-leaf nodes contains $\log_{2}n$ nodes $n+1$ nodes $2n$ nodes $2n+1$ nodes
Maddy_dahiphale
answered
in
DS
Feb 11
by
Maddy_dahiphale
9.0k
views
data-structures
binary-tree
isro2016
4
votes
1
answer
13
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 34
Suppose you implement a queue using a singly linked list with head and tail pointers so that the front of the queue is at the tail of the list, and the rear of the queue is at the head of the list. What is the best possible worst-case running ... $O(n)$ for dequeue. $O(n)$ for enqueue and $O(1)$ for dequeue. $O(n)$ for both functions.
Priyotosh2001
answered
in
DS
Feb 7
by
Priyotosh2001
316
views
goclasses2024-mockgate-14
data-structures
queue
linked-list
1-mark
5
votes
2
answers
14
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 44
Let $B$ be a binary search tree (BST) with eight nodes filled with the following set of eight integer keys $A=\{10,2,5,3,20,15,9,22\}$. The order in which these keys were inserted to create $B$ is not known. However ... are required to verify if all eight keys of $A$ are present in $B$. How many leaf nodes are present in B?
krishnajsw
answered
in
DS
Feb 6
by
krishnajsw
405
views
goclasses2024-mockgate-14
numerical-answers
data-structures
binary-search-tree
2-marks
7
votes
1
answer
15
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 45
Consider a stack whose elements are unsigned integers and support the following operations: PUSH a: Pushes the element 'a' onto the stack. ADD: Adds the two topmost elements, removes them, and pushes the result. SQR: Computes ... once, count it as many times as it is used. Your final count should include initial 3 PUSH instructions.
GO Classes
answered
in
DS
Feb 5
by
GO Classes
460
views
goclasses2024-mockgate-14
numerical-answers
data-structures
stack
2-marks
0
votes
0
answers
16
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.
GO Classes
asked
in
DS
Feb 5
by
GO Classes
175
views
gate2024-da-memory-based
goclasses
data-structures
binary-tree
7
votes
3
answers
17
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 40
You are given a complete binary tree (each level must be full except the last) on $n$ vertices. Each vertex $v$ is labeled by an integer value $x_v$. Say that a vertex is a local minimum if its label is less than the labels of each of its ... minimum in the tree? $\theta(n)$ $\theta(\sqrt{n})$ $\theta(\log n)$ $\theta(n \log n)$
Shreyas16
answered
in
DS
Jan 31
by
Shreyas16
695
views
goclasses2024-mockgate-13
goclasses
data-structures
binary-tree
time-complexity
2-marks
4
votes
2
answers
18
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 37
Consider the null-terminated linked list of four integers $\textsf{1->2->3->4->NULL},$ and the variable 'list' points to the head of the linked list. Upon running the provided code, the linked list gets divided into ... LINE X:list->next->next>next = list->next>next; LINE Y: list = list->next->next;
GauravRajpurohit
answered
in
DS
Jan 29
by
GauravRajpurohit
364
views
goclasses2024-mockgate-13
goclasses
data-structures
linked-list
2-marks
3
votes
1
answer
19
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 36
Let $\mathrm{T}$ be the smallest AVL tree of height $h$. How many nodes does it have, if the smallest AVL tree of height $h-2$ has $m$ nodes and the smallest AVL tree of height $h-3$ has $k$ nodes? $m+k+2$ $m+2 k$ $2 m+k$ $2 m+k+2$
thecoderyabham
answered
in
DS
Jan 28
by
thecoderyabham
326
views
goclasses2024-mockgate-13
goclasses
data-structures
avl-tree
2-marks
6
votes
1
answer
20
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 16
Suppose we constructed the binary search tree shown by starting with an empty tree and inserting one element at a time from an input sequence, without any rotations or other manipulations. Which of the following assertions about the order of elements in ... $29$ came before $42.$ $3$ came before $14$ and $16$ came before $28.$
GO Classes
answered
in
DS
Jan 28
by
GO Classes
384
views
goclasses2024-mockgate-13
goclasses
data-structures
binary-search-tree
1-mark
3
votes
1
answer
21
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 17
Suppose that a binary min-heap stores six elements with priorities $10,20,30,40,50$, and $60$ in its array $\text{A}.$ What is the largest of these items that could be stored in $\text{A}[2]?$ (indexing starts from zero)
GO Classes
answered
in
DS
Jan 28
by
GO Classes
417
views
goclasses2024-mockgate-13
goclasses
numerical-answers
data-structures
binary-heap
1-mark
4
votes
2
answers
22
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 32
The in-order traversal of a binary tree is $\textsf{HFIEJGZ},$ and the post-order traversal of the same tree is $\textsf{HIFJZGE}.$ What will be the total number of nodes in the left sub-tree of the given tree? (It is NOT a search tree)
Akash 15
answered
in
DS
Jan 23
by
Akash 15
332
views
goclasses2024-mockgate-12
goclasses
numerical-answers
data-structures
binary-tree
tree-traversal
2-marks
0
votes
2
answers
23
ISRO 2024
What is the maximum number of comparisons needed to sort 6 items using radix sort, if each number is a 3-digit decimal number? 120 180 210 360
MohitKashyap
answered
in
DS
Jan 22
by
MohitKashyap
419
views
isro-2024
radix-sort
data-structures
2
votes
1
answer
24
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 4
What are the sequence of popped-out values if the sequence of operations - $\textsf{push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), pop}$ are performed on a stack? $2, 2, 1, 1, 2$ $2, 2, 1, 1, 1$ $2, 1, 2, 2, 1$ $2, 1, 2, 2, 2$
GauravRajpurohit
answered
in
DS
Jan 22
by
GauravRajpurohit
280
views
goclasses2024-mockgate-12
goclasses
data-structures
stack
1-mark
easy
3
votes
1
answer
25
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 3
The Euclidean algorithm is used to find the greatest common divisor $(\mathrm{gcd})$ of two positive integers $\mathrm{a}$ and $\mathrm{b}$. input(a) input(b) while b>0 begin r:= a mod b a:= b b:= r end gcd:= a output(gcd) When the algorithm ... is the sequence of computed values for $r?$ $2,53,1,0$ $53,2,1,0$ $53,4,1,0$ $53,5,1,0$
GO Classes
answered
in
DS
Jan 21
by
GO Classes
334
views
goclasses2024-mockgate-12
goclasses
data-structures
linked-list
1-mark
0
votes
3
answers
26
Made Easy Test Series
In a max heap of n elements, the time complexity to find 10th largest element is: a)Θ(n log n) b)Θ(n) c)Θ(1) d)Θ(log n) I personally think it should be Θ(n), as the 10th largest element can be anywhere in the heap, all the elements need to be traversed once to decide that.
dhruv_2605
answered
in
DS
Jan 21
by
dhruv_2605
192
views
made-easy-test-series
data-structures
1
vote
3
answers
27
ISRO 2024
In a priority queue, insertion and deletion can be done at Front back Middle Any position
prasantkr.singh
answered
in
DS
Jan 21
by
prasantkr.singh
402
views
isro-2024
priority-queue
data-structures
2
votes
1
answer
28
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 31
How many binary trees with $3$ nodes, $\text{A, B},$ and $\text{C}$ when traversed in post-order will give the sequence $\text{A, B, C}?$ (It is NOT a search tree)
GO Classes
answered
in
DS
Jan 21
by
GO Classes
404
views
goclasses2024-mockgate-12
goclasses
numerical-answers
data-structures
binary-tree
tree-traversal
2-marks
29
votes
11
answers
29
GATE CSE 1998 | Question: 2.11
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is given by $x(n-1) +1$ $xn-1$ $xn +1$ $x(n+1)$
priyansh_1705
answered
in
DS
Jan 19
by
priyansh_1705
14.5k
views
gate1998
data-structures
tree
normal
2
votes
1
answer
30
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 53
Consider the linked list initially having values $1, 2, 2, 8, 6, 2, 2,$ and let the head be the pointer to the first node of the linked list. Which of the following options correctly represents the final linked list after the function call ... LinkedList will be $1, 8, 6$ Final LinkedList will be $1, 8, 6, 2, 2$ None of the above
Akash 15
answered
in
DS
Jan 14
by
Akash 15
301
views
goclasses2024-mockgate-11
goclasses
data-structures
linked-list
2-marks
6
votes
0
answers
31
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 52
Consider the following binary heap – Suppose the last operation you performed in the binary heap above was inserting the key $x$. What are the possible values of $x?$ $20$ $8$ $13$ $11$
GO Classes
asked
in
DS
Jan 13
by
GO Classes
477
views
goclasses2024-mockgate-11
goclasses
data-structures
binary-heap
multiple-selects
2-marks
0
votes
1
answer
32
ISRO 2024
From a character string of lenth $m$, the number of sub-strings of all lengths that can be formed are: $m^2$ $m$ $m(m+1)/2$ $m(\log m)$
Ramayya
asked
in
DS
Jan 7
by
Ramayya
166
views
data-structures
0
votes
0
answers
33
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.
Ramayya
asked
in
DS
Jan 7
by
Ramayya
116
views
isro-2024
data-structures
0
votes
1
answer
34
#Number of Minheaps Possible?
No of min heaps possible for the keys {1,1,1,2,3,4,5,6}
gendrone
asked
in
DS
Dec 24, 2023
by
gendrone
109
views
0
votes
1
answer
35
Made easy Data structures
Consider the following array of elements <96,42,50,17,15,5,7,11,39,23,6,9,19,100,12> The minimum number of interchanges using buildheap needed to convert it into a max heap is
amitarp818
asked
in
DS
Nov 28, 2023
by
amitarp818
547
views
data-structures
heap
made-easy-test-series
0
votes
1
answer
36
What is the infix to postfix evaluation of (A+B)*(C*D - E)*F / G
According to my knowledge, it should be AB+CD*E-*F*G/ And, here is the step-wise explanation of it Converting the bracket of (A+B) - AB+ There is operator but the next operand is entire bracket term, it has to be ... Please confirm if my logic and answer is correct or not. Note Mind the space around / operator. It is there on purpose.
tbhaxor
asked
in
DS
Nov 24, 2023
by
tbhaxor
578
views
stack
infix-prefix
Help get things started by
asking a question
.
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Programming
(4.1k)
DS
(2.0k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.7k
users
Recent questions and answers in DS
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation