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

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged datastructures
0
votes
0
answers
Data Structures
asked
Apr 7
in
DS
by
Relon
(
5
points)

7
views
datastructures
0
votes
1
answer
#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
asked
Feb 27
in
Algorithms
by
Hradesh patel
(
9
points)

20
views
datastructures
+1
vote
0
answers
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 minheap is _________ using built heap method." I am getting 7.
asked
Jan 6
in
Programming
by
anurags228
(
23
points)

25
views
heap
binarytree
datastructures
0
votes
0
answers
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 nonleaf nodes of the tree are ________. According to me, the answer should be 80* 8! The given answer is different.
asked
Jan 6
in
Programming
by
anurags228
(
23
points)

51
views
binarytree
datastructures
0
votes
1
answer
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 n1
asked
Jan 3
in
DS
by
Nitinkumar.097
(
13
points)

26
views
testseries
datastructures
0
votes
0
answers
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) ∗.
asked
Dec 23, 2020
in
Theory of Computation
by
aryan1234
(
5
points)

7
views
datastructures
0
votes
0
answers
#Self Doubt #Data_Strct #Binary_Tree
Maximum number of node at level I is 2^I. Prove
asked
Dec 19, 2020
in
DS
by
ApolloXYZ
(
1
point)

11
views
datastructures
binarytree
0
votes
0
answers
#Self Doubt #Data_Strct #Binary_Tree
What are the total number of nodes in a binary tree of height K ?
asked
Dec 19, 2020
in
DS
by
ApolloXYZ
(
1
point)

10
views
datastructures
binarytree
0
votes
0
answers
#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).
asked
Dec 18, 2020
in
Programming
by
BHOJARAM
(
13
points)

6
views
datastructures
0
votes
1
answer
#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
asked
Dec 17, 2020
in
DS
by
ApolloXYZ
(
1
point)

13
views
datastructures
binarytree
0
votes
0
answers
#Self Doubt #DataStrct
Prove that Maximum no. of node at level I is 2^I
asked
Dec 16, 2020
in
DS
by
ApolloXYZ
(
1
point)

15
views
datastructures
binarytree
0
votes
0
answers
#Self Doubt #DSBinaryTree
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
asked
Dec 16, 2020
in
DS
by
ApolloXYZ
(
1
point)

6
views
datastructures
binarytree
0
votes
2
answers
#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.
asked
Dec 16, 2020
in
DS
by
ApolloXYZ
(
1
point)

39
views
datastructures
binarytree
0
votes
0
answers
TESTSERIESME
I am getting 48 as a answer! please clear whether the given answer is correct or there is any mistake?
asked
Dec 6, 2020
in
Programming
by
Sinchit
(
17
points)

55
views
datastructures
0
votes
0
answers
Source: http://www.cs.iit.edu/~iraicu/teaching/EECS211/quiz4sol.pdf
asked
Nov 18, 2020
in
DS
by
rish18
(
9
points)

53
views
selfdoubt
binarytree
datastructures
0
votes
0
answers
#madeeasy #binarysearchtree
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?
asked
Nov 15, 2020
in
Programming
by
404 found
(
37
points)

25
views
datastructures
+1
vote
0
answers
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
asked
Nov 13, 2020
in
Programming
by
srestha
(
1k
points)

23
views
test
series
datastructures
+1
vote
1
answer
NIC Testbook test series
The post order traversal of a heap is ACEDBHIGF. The possible preorder traversal is: 1. ABCDEFGHI FBEACDGHI FBEADCGHI ABDCEFGIH
asked
Nov 10, 2020
in
DS
by
rsamarth
(
29
points)

43
views
datastructures
+2
votes
1
answer
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
asked
Nov 5, 2020
in
Programming
by
anushkaaa
(
43
points)

23
views
datastructures
0
votes
2
answers
Made Easy 2021
What would be the answer? I got 32, but it’s wrong.
asked
Oct 8, 2020
in
Programming
by
Sinchit
(
17
points)

68
views
datastructures
0
votes
3
answers
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]
asked
Aug 25, 2020
in
DS
by
Scion_of_fire
(
49
points)

287
views
datastructures
2dmatrix
0
votes
2
answers
#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?
asked
Aug 15, 2020
in
DS
by
Ankur29
(
5
points)

31
views
datastructures
madeeasytestseries
0
votes
2
answers
#datastructure #madeeasy
here L = no of leaves, n = n ary, i = no of internal node so L = (n1)*i +1 L = (31)*10 +1 L = 2*10 +1 = 21 so total no of leaf node = 21?? please clear my doubt
asked
Aug 15, 2020
in
DS
by
Ankur29
(
5
points)

21
views
madeeasytestseries
datastructures
binarytree
0
votes
1
answer
Self Doubt  Left Child Right Sibling (LCRS) representation
asked
Aug 15, 2020
in
DS
by
KUSHAGRA गुप्ता
(
1.4k
points)

50
views
datastructures
trees
binarytree
0
votes
0
answers
MadeEasy Test series  Binary tree question
These are the options given: (a) Print nodes at K distance from root node. (b) Print nodes of Kth level of binary tree. (c)Both a and b (d) None of these I think the answer would be Both (a) and (b), if we consider root node at Level 0. But the answer given is (a) only If someone could explain why (b) is not the answer than it would be great help.
asked
Jul 26, 2020
in
DS
by
luc_Bloodstone
(
19
points)

12
views
datastructures
madeeasytestseries
binarytree
0
votes
0
answers
Binary Search TreeTime complexity #Selfdoubt
I have the following query: Given a sorted array, I know that we can construct a balanced BST in O(n) time. https://www.geeksforgeeks.org/sortedarraytobalancedbst/ Suppose I have a sorted array [1,2,3,4,5,6.....n]. I want to construct a ... , T(n)=T(n1)+c.>O(n). Am I wrong? Please explain in detail so I can understand. Thanks in advance.
asked
Jul 25, 2020
in
Algorithms
by
Souraj Adhikary
(
5
points)

44
views
binarysearchtree
datastructures
0
votes
0
answers
made easy test series : Binary Tree
root → value = SumElements(root → left) root → value = SumElements(root → right) root → value = SumElements(root → left) + SumElements(root → right) SumElements(root → left) + SumElements(root → right) according to me ans shoul be none of ... + SumElements(root → left) + SumElements(root → right) but they have given ans is 3rd option.Am I missing something here??
asked
Jul 4, 2020
in
DS
by
abcd9982
(
87
points)

33
views
madeeasytestseries
datastructures
binarytree
+1
vote
0
answers
Ace_Datastructures
Choose incorrect statements from the options given below ? a stack and a queue can be implemented in a single array v[1...m]. ‘n’ circular queues can be implemented in a single array v[1...m], (m>>n) n1 stacks and n2=nn1 queues can be implemented in an array v[1….m] (m >>n) None of the above Anyone please clarify.
asked
Jun 8, 2020
in
Programming
by
Shivateja MST
(
45
points)

21
views
datastructures
stack
queue
0
votes
0
answers
Binary Tree Creation
This is function to create binary tree.But I am unable to write the base case for this recursion function.Any idea how it can be done? private static Node create() { Scanner sc = new Scanner(System.in); int value; System.out.println("Enter a value:" ... of " + value); newnode.right = create(); sc.close(); return newnode; } Thanks for your time and help in advance.
asked
May 23, 2020
in
Programming
by
amitnegi99
(
5
points)

9
views
datastructures
binarytree
0
votes
1
answer
Precedence of Expression evaluation in c programminh
asked
May 10, 2020
in
Programming
by
Sumit goyal 2
(
5
points)

41
views
datastructures
0
votes
1
answer
Tower of Hanoi
There are n disks of different sizes and three pegs. Initially, all the disks are on the first peg in order of size, the largest on the bottom and the smallest on top. The object is to transfer all the disks to the third peg. Only one disk can be moved ... a disk on the middle peg or move a disk from that peg. Write an algorithm that solves the problem in the minimum number of moves.
asked
May 8, 2020
in
Algorithms
by
sumitsehgal
(
5
points)

23
views
algorithms
datastructures
0
votes
2
answers
Tower of hanoi
There are n disks of different sizes and three pegs. Initially, all the disks are on the first peg in order of size, the largest on the bottom and the smallest on top. The object is to transfer all the disks to the third peg. Only one disk can be moved ... a disk on the middle peg or move a disk from that peg. Write an algorithm that solves the problem in the minimum number of moves.
asked
May 7, 2020
in
Algorithms
by
sumitsehgal
(
5
points)

46
views
algorithms
datastructures
0
votes
0
answers
GATE2016240 Video Solution
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
asked
Apr 18, 2020
in
DS
by
admin
(
573
points)

18
views
gate20162
datastructures
binarysearchtree
normal
numericalanswers
videosolution
0
votes
0
answers
GATE2007IT29 Video Solution
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$
asked
Apr 18, 2020
in
DS
by
admin
(
573
points)

11
views
gate2007it
datastructures
binarysearchtree
normal
videosolution
0
votes
0
answers
GATE200846 Video Solution
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient algorithm ... $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ None of the above, as the tree cannot be uniquely determined
asked
Apr 18, 2020
in
DS
by
admin
(
573
points)

10
views
gate2008
datastructures
binarysearchtree
normal
videosolution
0
votes
1
answer
GATE2016215 Video Solution
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decreasekey operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations on the ... together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$
asked
Apr 18, 2020
in
DS
by
admin
(
573
points)

23
views
gate20162
datastructures
linkedlists
timecomplexity
normal
videosolution
0
votes
2
answers
GATE2014339 Video Solution
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$ and $H$. Suppose there are $m$ such numbers in $T$. If the tightest upper bound on the time to compute the sum is $O(n^a\log^bn+m^c\log^dn)$, the value of $a+10b+100c+1000d$ is ______.
asked
Apr 18, 2020
in
DS
by
admin
(
573
points)

44
views
gate20143
datastructures
binarysearchtree
numericalanswers
normal
videosolution
0
votes
0
answers
GATE2016141 Video Solution
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing it ... x:= Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.
asked
Apr 18, 2020
in
DS
by
admin
(
573
points)

24
views
gate20161
datastructures
queue
difficult
numericalanswers
videosolution
0
votes
0
answers
GATE200323 Video Solution
In a minheap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
asked
Apr 18, 2020
in
DS
by
admin
(
573
points)

8
views
gate2003
datastructures
heap
videosolution
0
votes
0
answers
GATE200485 Video Solution
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ is: $\Large \min \left ( \substack{\text{number of leafnodes}\\\text{in leftsubtree of $ ... case time complexity of the program is? $\Theta (n)$ $\Theta (n \log n)$ $\Theta(n^2)$ $\Theta (n^2\log n)$
asked
Apr 18, 2020
in
DS
by
admin
(
573
points)

9
views
gate2004
binarysearchtree
normal
datastructures
videosolution
Page:
1
2
3
4
...
8
next »
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
9,200
questions
3,182
answers
14,686
comments
96,168
users