Recent questions tagged data-structures
Register

Recent questions tagged data-structures

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
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 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
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
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 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
0 answers 49 views
Data Structures
Relon asked in DS Apr 7
by Relon
5 points
49 views
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
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
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
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
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
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 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
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 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
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
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
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
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
Page:
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.
Developed by Chun