Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Exams
Recent questions and answers in DS
0
votes
0
answers
Made aesy test series : BFS
Consider the following graph: The minimum size of queue required when performing BFS on above graph is ________. (Take size of queue as by maximum number of elements at any time). What will be the correct answer for the foolowing question?
asked
Feb 5
in
DS
by
vishal burnwal
(
135
points)

27
views
madeeasytestseries
0
votes
0
answers
Testbook: Mock
In a BST, the key with value 5 was searched after traversing nodes with values 1,3,4,6,7,8,9, not necessarily in that order. What is the probability that the 3rd element on the search path beginning from the root is either 3 or 8?
asked
Jan 29
in
DS
by
Sambhrant Maurya
(
396
points)

73
views
probability
binary_search_tree
0
votes
0
answers
applied gate mock 5
[closed]
asked
Jan 27
in
DS
by
abhinav649
(
67
points)

34
views
hashing
0
votes
1
answer
madeeasy test series answer doubt
https://csedoubts.gateoverflow.in/8774/madeeasytestseries2020minheap what is the correct answer? 6 or 7
answered
Jan 25
in
DS
by
shashin
(
1.9k
points)

30
views
0
votes
0
answers
ISRO2020 Exam
The Postorder traversal of a binary tree is ACEDBHIGF. the preorder Traversal is? ABCDEFGHI FBADCEGIH FABCDEGHI ABDCEFGIH
asked
Jan 25
in
DS
by
aditya dhanraj
(
7
points)

11
views
#isro2020
0
votes
0
answers
Madeeasy test series  Retrieve address of element in matrix
asked
Jan 21
in
DS
by
luc_Bloodstone
(
36
points)

20
views
madeeasytestseries
data_structure
algorithms
0
votes
0
answers
Madeeasy test series  recurrence relation
asked
Jan 21
in
DS
by
luc_Bloodstone
(
36
points)

7
views
recurrencerelations
madeeasytestseries
timecomplexity
algorithms
0
votes
0
answers
Made Easy test series data structure binary search tree
asked
Jan 21
in
DS
by
Ram Swaroop
(
173
points)

25
views
madeeasytestseries
data_structure
bst
binary_search_tree
0
votes
0
answers
Enqueue and Dequeue
asked
Jan 20
in
DS
by
Akash Papnai
(
17
points)

6
views
data_structure
queue
+1
vote
0
answers
Gatebook Heaps
What is the minimum number of comparisons required in the worst case to find the smallest element in a minheap? Can someone please explain the procedure. The answer is 50*51 / 2
asked
Jan 20
in
DS
by
neeraj_bhatt
(
268
points)

9
views
heap
gatebook
0
votes
0
answers
Applied course test series DS
Which of the following statements is/are true? Converting an adjacency matrix representation to an adjacency list representation takes O(V+E) time. In any connected undirected graph with exactly 5 simple cycles (that do not share any edges), there are at most 10 ... between every pair of vertices Options: Only I Only II Both I and II Neither I nor II PS.: Answer is d.
asked
Jan 18
in
DS
by
Shubhranshu Maurya
(
8
points)

18
views
graph
data_structure
graphtheory
0
votes
0
answers
Test series gateflix
No. of possible BST with n elements numbered 1,2,…,n with exactly two leaf nodes ?
asked
Jan 12
in
DS
by
Dipanshu Rana
(
34
points)

11
views
0
votes
0
answers
Applied course test series : Queue
Consider a circular queue q' is implemented whose size is given 15 and the locations of the elements of the queue are q[0],q[1],q[2], .,q[14]. In this given circular queue currently rear is pointing at q[7] after inserting 11th element, then find the position of front ... ,...). A) q[2] B) q[3] C) q[11] D) q[12] What will be the correct answer for above question?
asked
Jan 7
in
DS
by
vishal burnwal
(
135
points)

15
views
queue
0
votes
0
answers
MadeEasy FULL SYLLABUS TEST5 (ADVANCE LEVEL) GATE 2020  Q35 BST
asked
Jan 5
in
DS
by
DukeThunders
(
415
points)

19
views
0
votes
0
answers
Cormen 3e BST Exercise12.28 page no294
Prove that no matter what node we start at in a heighth binary search tree, k successive calls to TREESUCCESSOR take O(k + h) time
asked
Jan 3
in
DS
by
aditi19
(
55
points)

14
views
data_structure
bst
binarytree
cormen
0
votes
0
answers
Made easy Q48 Full length 2019
Please Explain
asked
Jan 1
in
DS
by
ssap09
(
42
points)

26
views
madeeasytestseries
#gatepreparation
data_structure
0
votes
1
answer
ACE Subject wise test
, A tree is an undirected graph G that satisfies Q)G is connected and the 3vertex complete graph K3 is not a minor of G. T/F (what is minor of G)??
answered
Dec 29, 2019
in
DS
by
Pratyush Priyam Kuan
(
803
points)

31
views
0
votes
1
answer
MadeEasy FULL SYLLABUS TEST1 (BASIC LEVEL) GATE 2020 Q58
answered
Dec 29, 2019
in
DS
by
neeraj_bhatt
(
268
points)

27
views
0
votes
1
answer
ACE FULL LENGTH MOCK TEST1
What is the converse preorder of the following binary tree if the given inorder and postorder as follows Inorder:ACDEBGHF Postorder:ADECHFGB a)BCAEDGFH b)BCAEDGHF c)BCADEGFH d)BGFHCEDA
answered
Dec 24, 2019
in
DS
by
Pratyush Priyam Kuan
(
803
points)

32
views
0
votes
0
answers
ACE DS Test Series
Consider a BST T with all distinct keys. If the right subtree of a node X in the tree T is empty and X has inorder successor, the minimum number of ancestor of node X is_______________(Every node is considered to be it’s own ancestor also) Given ans 2 and my ans 1. Which one correct?
asked
Dec 22, 2019
in
DS
by
srestha
(
679
points)

13
views
datastructures
0
votes
0
answers
MadeEasy Multi Subject DS+Algo 2020 Test Q33 Max Heap
asked
Dec 21, 2019
in
DS
by
DukeThunders
(
415
points)

30
views
+1
vote
0
answers
#data structute
Q.how many stack are required to calculate prefix and postfix expression?
asked
Dec 17, 2019
in
DS
by
amit166
(
139
points)

7
views
#stack
0
votes
2
answers
Self DoubtArrays
$3d\ array:$ $A[5….11,3…7,6….16]$ Using column major order and row major order find: $location\left ( A[9][5][14] \right )=?$ take BA: 1000 and int size: 10 bytes
answered
Dec 13, 2019
in
DS
by
Mk Utkarsh
(
505
points)

80
views
datastructures
array
columnmajor
0
votes
0
answers
Applied course test series : Topological sorting
Which of the following is not the topological sorting of the below graph. A) 1,2,3,4,5,6,7,8,9,10,11 B) 1,3,2,5,4,6,7,8,9,10,11 C) 1,3,2,4,5,6,8,7,10,9,11 D) 1,3,2,4,5,6,8,7,9,10,11 My doubt is that according to me all the four orders given are correct ,but they provided (D) as the answer. Are they right?
asked
Dec 12, 2019
in
DS
by
vishal burnwal
(
135
points)

23
views
graph
0
votes
1
answer
ME  test series
Consider 3 dimensional array $A[90][30][40]$ stored in linear array in column major order, if the base address starts at $10$, what is the location of $A[20][20][30]$? Assume the first element is stored at $A[1][1][1]$. Solution given is: But I think that is row major order. Isn’t it?
answered
Dec 11, 2019
in
DS
by
arya_stark
(
64
points)

76
views
dsa
#array
columnmajor
0
votes
1
answer
GATEBOOK DSA
You are given a hash table with n keys and m slots, with the simple uniform hashing (assume each key is equally likely to be hashed into each slot). Collisions are resolved by chaining. What is the expected number of slots that end up not being empty ?
answered
Dec 10, 2019
in
DS
by
goxul
(
375
points)

39
views
dsa
hashing
gatebook
0
votes
1
answer
GATE GURU:DSA 596
What is the worst case time complexity to delete random element in a binary heap 1. O(nlogn) 2. O(logn) 3. O(n2) 4. O(n)
answered
Dec 7, 2019
in
DS
by
Pratyush Priyam Kuan
(
803
points)

18
views
data_structure
0
votes
0
answers
Made easy test series : Binary Search Tree
A binary search tree with n nodes is constructed. Along with the key each node stores the no. of elements in the sub tree rooted at that node . We have given two elements a and b ,such that a<b . What will be the no. of comparisons and addition ... n) C.) O(log n) and O(loglog n) D.) O(n) and O(n) Plz explain above question and give solution.
asked
Dec 5, 2019
in
DS
by
vishal burnwal
(
135
points)

14
views
madeeasytestseries
0
votes
0
answers
#DataStructure#METest_Series
Why b option is wrong? For root it should be valid. Plz explain
asked
Dec 3, 2019
in
DS
by
nandani17
(
33
points)

11
views
0
votes
1
answer
Made Easy Test Series:DS
The number of min heaps possible with 15 distinct elements such that every leaf node is greater than all the nonleaf nodes are ______
[closed]
answered
Nov 27, 2019
in
DS
by
srestha
(
679
points)

43
views
madeeasytestseries
datastructures
heap
0
votes
0
answers
Made Easy Test Series DS
The number of BSTs possible with 6 nodes numbered 1,2,3,4,5,6 with exactly one leaf node are _______
asked
Nov 27, 2019
in
DS
by
Sambhrant Maurya
(
396
points)

39
views
madeeasytestseries
datastructures
trees
0
votes
0
answers
GATE GURU: P & DS
The height h of an AVL tree with n nodes lies in the interval: 1. log10 (n) ≤ h < c log10 (n+1)+b 2. log2 (n) ≤ h < c log2 (n+1)+b 3. log10 (n+1) ≤ h < c log10 (n+2)+b 4. log2 (n+1) ≤ h < c log2 (n+2)+b Not able to understand the question, can anyone answer?
asked
Nov 21, 2019
in
DS
by
Debapaul
(
698
points)

11
views
0
votes
1
answer
GATE GURU :DSA 2020 TOPIC TEST
Which of the following does not define a tree ? 1. A tree is an acyclic graph with n1 edges where n' is the number of vertices in the graph. 2. A tree is a connected acyclic graph. 3. A tree is an acyclic connected graph with n1 edges where n' is ... 't all the options right? Ans given is D, but how can D be the ans, as a graph with no cycles must be a tree right?
answered
Nov 21, 2019
in
DS
by
Satbir
(
4.1k
points)

12
views
data_structure
0
votes
0
answers
GATE GURU TEST : DSA
consider the following infix expression (P+Q*R^S)/(P+Q^S) What is the minimum size of stack required to convert this infix expression to postfix expression?
asked
Nov 19, 2019
in
DS
by
Debapaul
(
698
points)

36
views
#gate
0
votes
0
answers
madeeasy test
Number of min heap tree possible with 15 distinct element such that every leaf node must be greater than all nonleaf nodes of the tree are_______________. ans given as 8! * 4! * 2! *1( as it's assuming that always leaf nodes are maximum than any other ... other nonleaf node). suppose, 2648957(consider elements in an array) see 5 & 6 How can we count this type of combinatons.
asked
Nov 17, 2019
in
DS
by
MRINMOY_HALDER
(
37
points)

22
views
madeeasytestseries
data_structure
0
votes
0
answers
Made Easy Test Series 2020 Min heap
Consider the following array elements <40,35,20,10,15,16,17,8,4,30> The minimum number of interchanges needed to convert into a min heap using build heap method is ? I am getting 7 as the answer but it is given 6 as the answer kindly help me understand where i am going wrong.
asked
Nov 7, 2019
in
DS
by
Piyush ####
(
9
points)

38
views
0
votes
0
answers
ace test series GATE 2020 trees
can someone please explain the below question
asked
Oct 28, 2019
in
DS
by
Pratyush Priyam Kuan
(
803
points)

10
views
data_structure
0
votes
0
answers
self ___doubts
What is the meaning of ROOTED binary tree 1)2nCn / (n+1) , for the number unlabeled trees 2)2nCn / (n+1) ) * (n!) , for labeled trees 3)No of Labelled Trees => n pow n2 4)Total No of rooted labeled trees => (n pow n2) * n => n pow n1 please diff b/w all 4
asked
Oct 11, 2019
in
DS
by
mohan123
(
20
points)

15
views
0
votes
0
answers
gatebook_graph
The edge graph of a graph G is the graph with vertex set E(G) in which two vertices are joined if and only if they are adjacent edges in G. if G is a simple graph with degree sequence , the no of edges in edge graph of G is?
asked
Oct 10, 2019
in
DS
by
mohan123
(
20
points)

7
views
0
votes
1
answer
Self doubt:GATE 2004 Data Structures
In below question, it can be done via both front and rear node as well, isn't it? A circularly linked list is used to represent a Queue. A single variable p is used to access the Queue. To which node should p point such that both ... the nptel video below shows for front node. Please let me know if I'm missing something. https://youtu.be/PGWZUgzDMYI?t=31m32s
answered
Oct 10, 2019
in
DS
by
Abhinav993
(
85
points)

24
views
To see more, click for all the
questions in this category
.
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
Feb 2020
shashin
363 Points
Shaik Masthan
79 Points
SuvasishDutta
39 Points
srestha
33 Points
Mk Utkarsh
32 Points
neeraj_bhatt
31 Points
!KARAN
30 Points
Debapaul
23 Points
Pratyush Priyam Kuan
18 Points
kalra05
18 Points
Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
All categories
General Aptitude
62
Engineering Mathematics
423
Digital Logic
205
Programming & DS
351
Programming
272
DS
78
Algorithms
302
Theory of Computation
443
Compiler Design
216
Operating System
310
Databases
326
CO & Architecture
279
Computer Networks
277
Non GATE
5
Others
67
Admissions
24
Exam Queries
34
Tier 1 Placement Questions
2
Job Queries
4
Projects
1
Recent questions and answers in DS
3,331
questions
1,581
answers
10,281
comments
89,916
users