menu
Recent questions tagged data-structures
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged data-structures
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged data-structures
0
votes
0
answers
63
views
DS from MADEEASY postal book package 2022 page number 12
kishanrajput
asked
in
Programming
Sep 5
by
kishanrajput
5
points
63
views
data-structures
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
28
views
THIS IS A PROGRAM RELATED TO STRUCTURES CONCEPT IN C LANGUAGE
Kaneki
asked
in
Programming
Aug 12
by
Kaneki
5
points
28
views
data-structures
0
votes
0
answers
37
views
Applied AI
There is a question in the test series of Applied Gate. This is a not a min heap, as far as i can understand. Can someone clarify how this is a min-heap?
Ranjan.ashishmit
asked
in
Programming
Aug 12
by
Ranjan.ashishmit
5
points
37
views
data-structures
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
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
1
vote
1
answer
50
views
Generic doubt about Trees in data structure subject.
Pawan Nirpal
asked
in
DS
May 20
by
Pawan Nirpal
9
points
50
views
data-structures
binary-tree
trees
0
votes
0
answers
49
views
Data Structures
Relon
asked
in
DS
Apr 7
by
Relon
5
points
49
views
data-structures
0
votes
1
answer
30
views
#self doubt #Algorithm #Spanning tree
True/False 1) Multiplying all edge weight by a positive number might change the graph MST. 2) If all edge in a graph have distinct weight than the shortest path between two vertices is unique. Please answer with reason. Thanks
Hradesh patel
asked
in
Algorithms
Feb 27
by
Hradesh patel
9
points
30
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
1
answer
1.3k
views
GATE CSE 2021 Set 1 | Question: 2 | Video Solution
Arjun
asked
in
DS
Feb 18
by
Arjun
1.5k
points
1.3k
views
gate2021-cse-set1
data-structures
arrays
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
1
vote
0
answers
33
views
Made easy Topicwise DS
"Consider the following array of elements <40, 35, 20, 10, 15, 16, 17, 8, 4, 30>. The minimum number of interchanges needed to convert it into a min-heap is _________ using built heap method." I am getting 7.
anurags228
asked
in
Programming
Jan 6
by
anurags228
23
points
33
views
heap
binary-tree
data-structures
0
votes
0
answers
69
views
Made Easy Topic Wise DS
The number of min heap trees are possible with 15 distinct elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________. According to me, the answer should be 80* 8! The given answer is different.
anurags228
asked
in
Programming
Jan 6
by
anurags228
23
points
69
views
binary-tree
data-structures
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
Nitinkumar.097
asked
in
DS
Jan 3
by
Nitinkumar.097
13
points
32
views
test-series
data-structures
0
votes
0
answers
14
views
John C. Martin 4.9
4.9. Suppose that G1 = (V1, {a, b}, S1, P1) and G2 = (V2, {a, b}, S2, P2) are CFGs and that V1 ∩ V2 = ∅. a. It is easy to see that no matter what G1 and G2 are, the CFG Gu = (Vu, {a, b}, Su, Pu) defined by Vu = V1 ∪ V2, Su = S1, and Pu = P1 ∪ ... {S1 → S1S1 | } generates every string in L(G1) ∗. Find a grammar G1 with V1 = {S1} and a string x ∈ L(G ∗ ) such that x /∈ L(G) ∗.
aryan1234
asked
in
Theory of Computation
Dec 23, 2020
by
aryan1234
5
points
14
views
data-structures
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
0
answers
8
views
#self doubt on c programming
c+ = p&1; //c and p are integers How the above statement is executed..either c= (c+p)&1 or c= c+(p&1).
BHOJARAM
asked
in
Programming
Dec 18, 2020
by
BHOJARAM
13
points
8
views
data-structures
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
ApolloXYZ
asked
in
DS
Dec 17, 2020
by
ApolloXYZ
1
point
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
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.
ApolloXYZ
asked
in
DS
Dec 16, 2020
by
ApolloXYZ
1
point
55
views
data-structures
binary-tree
0
votes
0
answers
92
views
TESTSERIES-ME
I am getting 48 as a answer! please clear whether the given answer is correct or there is any mistake?
Sinchit
asked
in
Programming
Dec 6, 2020
by
Sinchit
17
points
92
views
data-structures
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
0
votes
0
answers
30
views
#made-easy #binary-search-tree
select the correct statements .binary search trees(regardless of the order in which values are inserted into the tree). a)always have multiple links per node b)can be sorted efficiently c)always have the same shape for a particular set of data d)are non linear data structures ans is a,b,d can someone explain a,b part?
404 found
asked
in
Programming
Nov 15, 2020
by
404 found
37
points
30
views
data-structures
1
vote
0
answers
46
views
Testbook Test :Programming
Polynomial addition is implemented using which data structure? $(a)$ Queue $(b)$ Linked List $(c)$ Tree $(d)$ Stack Here My ans was Tree but given ans is Linked List Which one correct? Explaination according to them
srestha
asked
in
Programming
Nov 13, 2020
by
srestha
1k
points
46
views
test
series
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
rsamarth
asked
in
DS
Nov 10, 2020
by
rsamarth
29
points
68
views
data-structures
2
votes
1
answer
33
views
trishna knowledge systems- functions
What will be the output of the following program? main( ) { main( ); } (A) overflow error (B) syntax error (C) returns 0 (D) returns 1
anushkaaa
asked
in
Programming
Nov 5, 2020
by
anushkaaa
43
points
33
views
data-structures
0
votes
2
answers
103
views
Made Easy 2021
What would be the answer? I got 32, but it’s wrong.
Sinchit
asked
in
Programming
Oct 8, 2020
by
Sinchit
17
points
103
views
data-structures
0
votes
3
answers
427
views
made easy test series 2021
Consider a 2 dimensional array A[0 --- 39, 0 --- 39] in lower triangular matrix representation. The size of each element in the array is 1 byte. If the array is implemented in the memory in the form of row major order and base address of the ... 500. The address of A[15][25] will be _____. [Note: Only lower triangular elements of the matrix are stored in contiguous array]
Scion_of_fire
asked
in
DS
Aug 25, 2020
by
Scion_of_fire
49
points
427
views
data-structures
2d-matrix
0
votes
2
answers
46
views
#datastructure #madeeasy #binarytree
sir max height of AVL tree is 1.44*log2 n. 1.44log2 36 = 7.44 so here maximum height of AVL tree with 36 node is 7?
Ankur29
asked
in
DS
Aug 15, 2020
by
Ankur29
5
points
46
views
data-structures
made-easy-test-series
0
votes
2
answers
30
views
#datastructure #madeeasy
here L = no of leaves, n = n ary, i = no of internal node so L = (n-1)*i +1 L = (3-1)*10 +1 L = 2*10 +1 = 21 so total no of leaf node = 21?? please clear my doubt
Ankur29
asked
in
DS
Aug 15, 2020
by
Ankur29
5
points
30
views
made-easy-test-series
data-structures
binary-tree
Page:
1
2
3
4
...
9
next »
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.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts