menu
Recent questions and answers in DS
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions and answers in DS
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions and answers in DS
0
votes
0
answers
48
views
Madeeasy postal course 2022 DS and Programming page 12
kishanrajput
asked
in
DS
Sep 5
by
kishanrajput
5
points
48
views
data-structures
dynamic-scoping
madeeasyworkbook
0
votes
0
answers
30
views
#testseries
Given AVL tree is originally balanced. If a node is added to T1 so that height of 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
Abhishek tarpara
asked
in
DS
Aug 21
by
Abhishek tarpara
13
points
30
views
made-easy-test-series
trees
data-structures
0
votes
0
answers
12
views
#testsseries
Consider the following graph: Which of the following statements are false? A.There is no cycle in the above graph. B.There are exactly 3 back edges for a given DFS tree in the graph. C.There is atleast one strongly connected component present in the graph. D.The graph has a topological sort.
Abhishek tarpara
asked
in
DS
Aug 18
by
Abhishek tarpara
13
points
12
views
data-structures
dfs
trees
graph-connectivity
0
votes
0
answers
35
views
#bfs #test-series
Find the number of possible BFS ordering for the graph given below. [Starting from node 1]
Abhishek tarpara
asked
in
DS
Aug 18
by
Abhishek tarpara
13
points
35
views
bfs
graph-theory
trees
data-structures
algorithms
0
votes
0
answers
27
views
self doubt
Let's say we have an array of 39 distinct elements. We want to arrange them in ascending order. We want to use quick sort for it. We take the pivot element uniformly at random. Calculate the probability of placing the pivot element at worst possible ... seem similar question but that has phrase like in the first round of partitioning. I doubt both questions are same. Please respond soon.
sameer11
asked
in
DS
Aug 12
by
sameer11
5
points
27
views
self-doubt
algorithms
0
votes
0
answers
34
views
Zeal 2019 Booklet
How many n node binary trees with items 1,2,...,n have identical postorder and inorder traversals? 0 1 n n!
abhinav dongre
asked
in
DS
Jul 24
by
abhinav dongre
5
points
34
views
binary-tree
0
votes
0
answers
24
views
Zeal 2019
In order to reverse the elements of stack of size N, first pop off the elements one by one from the stack and enqueue them into the queue, then dequeue the elements one by one from the queue and push them back onto the stack. What is time complexity of the above operation? $\Theta$ (N) $\Theta$ (N^2) $\Theta$ (N^3) $\Theta$(logN)
abhinav dongre
asked
in
DS
Jul 23
by
abhinav dongre
5
points
24
views
stack
0
votes
0
answers
19
views
#MadeEasyBook #InfixExpression #Stack #DataStructures
Lata Patwal
asked
in
DS
Jul 13
by
Lata Patwal
9
points
19
views
data-structures
0
votes
0
answers
15
views
#SelfDoubt#Hashing#MidSquareMethod#DataStructures
In Mid Square Method(Hashing), we square the given number and then use appropriate bits from the middle. Can we have so many answers for a particular question? On what basis we choose the middle digit? What if the square is 4 digit 1234, then what will be the middle value? Will it be 23 or 2 or 3. Please explain.
Lata Patwal
asked
in
DS
Jul 10
by
Lata Patwal
9
points
15
views
hashing
data-structures
0
votes
0
answers
98
views
Gate CSE 2012
The worst case running time to search for an element in a balanced binary search tree with n2^n elements is A. Theta (nlogn) B. Theta (n2^n) C. Theta (n) D. Theta (logn) I am confused about the term balanced here because though we know about AVL ... AVL tree here? And ofcourse I am also curious to know how to solve this question. I will be grateful for your opinions. Regards, Ananya
Ananya Nayak
asked
in
DS
Jul 3
by
Ananya Nayak
5
points
98
views
binary-search-tree
binary-tree
time-complexity
searching
0
votes
0
answers
28
views
#Made Easy Test Series 2022 #Algorithms-I
Assume a scenario in which min-max heap has the following property: An almost complete binary tree where each node at an even level in the tree is less than all of its descendants and each of the node at an odd level in the tree is greater than all of its ... (d) Ο(n) for max and Ο(log n) for min or Ο(n) for min and Ο(log n) for max respectively
Sibu08
asked
in
DS
Jun 29
by
Sibu08
5
points
28
views
made-easy-test-series
algorithms
4
votes
1
answer
1.3k
views
GATE CSE 2021 Set 1 | Question: 2 | Video Solution
amitkhurana512
answered
in
DS
Jun 24
by
amitkhurana512
173
points
1.3k
views
gate2021-cse-set1
data-structures
arrays
1
vote
1
answer
50
views
Generic doubt about Trees in data structure subject.
Deepakk Poonia (Dee)
answered
in
DS
May 24
by
Deepakk Poonia (Dee)
1.7k
points
50
views
data-structures
binary-tree
trees
0
votes
0
answers
28
views
Go Book 2020 volume 2 page number 160 question no. 3.14.6
prateek_hazard
asked
in
DS
May 23
by
prateek_hazard
5
points
28
views
algorithms
data-structures
trees
0
votes
1
answer
204
views
TOPICWISE : PROGRAMMING AND DATA STRUCTURES-2 (GATE - 2020)
aryavart
answered
in
DS
May 18
by
aryavart
73
points
204
views
0
votes
0
answers
49
views
Data Structures
Relon
asked
in
DS
Apr 7
by
Relon
5
points
49
views
data-structures
1
vote
3
answers
1k
views
GATE CSE 2021 Set 2 | Question: 2 | Video Solution
Arjun
asked
in
DS
Feb 18
by
Arjun
1.5k
points
1k
views
gate2021-cse-set2
data-structures
heap
binary-heap
time-complexity
2
votes
2
answers
904
views
GATE CSE 2021 Set 2 | Question: 16 | Video Solution
Arjun
asked
in
DS
Feb 18
by
Arjun
1.5k
points
904
views
gate2021-cse-set2
numerical-answers
data-structures
binary-tree
4
votes
3
answers
1.1k
views
GATE CSE 2021 Set 1 | Question: 10 | Video Solution
Arjun
asked
in
DS
Feb 18
by
Arjun
1.5k
points
1.1k
views
gate2021-cse-set1
data-structures
binary-search-tree
time-complexity
0
votes
2
answers
698
views
GATE CSE 2021 Set 1 | Question: 21 | Video Solution
Arjun
asked
in
DS
Feb 18
by
Arjun
1.5k
points
698
views
gate2021-cse-set1
data-structures
stack
numerical-answers
4
votes
2
answers
2.4k
views
GATE CSE 2021 Set 1 | Question: 41 | Video Solution
Arjun
asked
in
DS
Feb 18
by
Arjun
1.5k
points
2.4k
views
gate2021-cse-set1
multiple-selects
data-structures
trees
0
votes
0
answers
57
views
gate overflow book
https://gateoverflow.in/4208/gate2000-2-19 The above is the link of the question. In the question it is given that DFS results in a DFS tree T. Does this strictly imply that the graph is connected? Because if not then we can even have a disconnected graph as a counter example
hadarsh
asked
in
DS
Feb 4
by
hadarsh
5
points
57
views
graph
algorithms
0
votes
1
answer
149
views
Applied GATE test series
Que Consider a circular queue which is of capacity 100 elements and is implemented on an array a[0...99], at a particular instant the front pointer is pointing to index 20 and the rear is pointing at index 10 the number of elements present in the queue is. 10 90 91 None
Abhisheksmile94
answered
in
DS
Jan 16
by
Abhisheksmile94
347
points
149
views
test-series
self-doubt
0
votes
1
answer
57
views
#gate2000#cse#graph
Why b option is incorrect Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal. Which of the following ... u is a leaf in T (D) If {u,v} is not an edge in G then u and v must have the same parent in T
zxy123
answered
in
DS
Jan 14
by
zxy123
3.6k
points
57
views
explain
0
votes
0
answers
42
views
self doubt madeeasy test series
https://gateoverflow.in/311536/made-easy-test-series-binary-tree how tree will look like ...please see
eyeamgj
asked
in
DS
Jan 12
by
eyeamgj
29
points
42
views
test-series
0
votes
0
answers
40
views
SELF DOUBT HASHING
https://gateoverflow.in/57653/cormen-2nd-edition-exercise-11-2-1 WHY WE CANT DO LIKE THIS …...NUMBER OF COLLISIONS(X) : 0 1 2 3 4 …………………...N-1 P(X): 0/M 1/M 2/M…………………… … ………….(N-1)/M
eyeamgj
asked
in
DS
Jan 12
by
eyeamgj
29
points
40
views
hashing
0
votes
0
answers
15
views
AVL PREVIOUS YEAR DATA STRUCTURE SELF DOUBT
https://gateoverflow.in/86224/gate1990-13a for tym complexity ..is it like …..n times we need to search position so O(nlogn) n insertion so O(n) and only two rotation so O(logn)...because i m not rotating for each iteration just doing at last so overall O(nlogn)...please look...
eyeamgj
asked
in
DS
Jan 8
by
eyeamgj
29
points
15
views
self-doubt
0
votes
1
answer
32
views
Applied Test series Data Structure
Maximum no of elements which can be inserted in a queue which is implemented using a circular queue on an array of size 10. Answer given was: (9) The maximum number of elements which can be stored in a circular queue of array of size n is n-1
Abhisheksmile94
answered
in
DS
Jan 3
by
Abhisheksmile94
347
points
32
views
test-series
data-structures
0
votes
1
answer
57
views
Gate previous year question
Q. Let Q denote a queue containing 16 numbers and S be an empty stack. Head(Q) returns the element at the head of queue Q without removing it from Q. similarly Top(S) returns the element at the top of S without removing it from S. consider ... else x:=Pop(S); Enqueue(Q,x); end end The maximum possible number of iteration of the while loop in the algorithm is_________
wander
answered
in
DS
Jan 1
by
wander
301
points
57
views
self-doubt
0
votes
2
answers
87
views
ACE test Series
Suppose that a tree T has N1 vertices of degree 1, 2 vertices of degree 2 , 4 vertices of degree 3 And 3 vertices of degree 4. Number of vertices in the tree is ? Answer given is 21
toxicdesire
answered
in
DS
Dec 22, 2020
by
toxicdesire
555
points
87
views
graphs
graph-theory
0
votes
0
answers
14
views
#Self Doubt #Data_Strct #Binary_Tree
Maximum number of node at level I is 2^I. Prove
ApolloXYZ
asked
in
DS
Dec 19, 2020
by
ApolloXYZ
1
point
14
views
data-structures
binary-tree
0
votes
0
answers
14
views
#Self Doubt #Data_Strct #Binary_Tree
What are the total number of nodes in a binary tree of height K ?
ApolloXYZ
asked
in
DS
Dec 19, 2020
by
ApolloXYZ
1
point
14
views
data-structures
binary-tree
0
votes
2
answers
55
views
#Self Doubt #DataStruct
The degree of a node is the no. of children it has. Show that in any binary tree the number of leaves is 1 more than the no. of nodes of degree 2.
Sahil91
answered
in
DS
Dec 17, 2020
by
Sahil91
683
points
55
views
data-structures
binary-tree
0
votes
1
answer
18
views
#Self Doubt #Data Struct
Prove by Induction that if T us a binary tree with n internal nodes, I its internal path lane and P its external path lane then E=I+2n, where n>=0
gajendercse
answered
in
DS
Dec 17, 2020
by
gajendercse
41
points
18
views
data-structures
binary-tree
0
votes
0
answers
19
views
#Self Doubt #DataStrct
Prove that Maximum no. of node at level I is 2^I
ApolloXYZ
asked
in
DS
Dec 16, 2020
by
ApolloXYZ
1
point
19
views
data-structures
binary-tree
0
votes
0
answers
11
views
#Self Doubt #DS-BinaryTree
Prove by Induction that if T is a binary tree with n internal nodes, I (its internal path lane) and P (its external path lane), then E=I+2n where n>=0
ApolloXYZ
asked
in
DS
Dec 16, 2020
by
ApolloXYZ
1
point
11
views
data-structures
binary-tree
0
votes
1
answer
109
views
Made Easy Test Series
The average successful search time taken by binary search on a sorted array of 10 items is ___________
ijnuhb
answered
in
DS
Dec 3, 2020
by
ijnuhb
751
points
109
views
test-series
0
votes
1
answer
55
views
NIELIT NIC scientist-B 2020 set-C ques 82
Suppose we have to insert the following sequence of keys into an empty binary search tree: 5, 7, 45, 60, 50, 23, 15, 54 What would be the height of binary search tree?
zxy123
answered
in
DS
Nov 26, 2020
by
zxy123
3.6k
points
55
views
binary-tree
0
votes
0
answers
89
views
Source: http://www.cs.iit.edu/~iraicu/teaching/EECS211/quiz4-sol.pdf
rish-18
asked
in
DS
Nov 18, 2020
by
rish-18
9
points
89
views
self-doubt
binary-tree
data-structures
1
vote
1
answer
68
views
NIC Testbook test series
The post order traversal of a heap is ACEDBHIGF. The possible pre-order traversal is: 1. ABCDEFGHI FBEACDGHI FBEADCGHI ABDCEFGIH
zxy123
answered
in
DS
Nov 10, 2020
by
zxy123
3.6k
points
68
views
data-structures
To see more, click for all the
questions in this category
.
Ask
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
2021 Nov 29 - Dec 05
zxy123
6 Points
Shaik Masthan
2 Points
Weekly Top User (excluding moderators) will get free access to
GATE Overflow Test Series for GATE 2021
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Recent questions and answers in DS
Search GATE CSE Doubts