Recent questions and answers in DS
Register

Recent questions and answers in DS

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
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
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
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
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
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
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
0 votes
0 answers 19 views
#MadeEasyBook #InfixExpression #Stack #DataStructures
Lata Patwal asked in DS Jul 13
by Lata Patwal
9 points
19 views
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
  1. zxy123

    6 Points

  2. Shaik Masthan

    2 Points

Weekly Top User (excluding moderators) will get free access to GATE Overflow Test Series for GATE 2021
Recent questions and answers in DS
Developed by Chun