The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged spanningtree
+2
votes
1
answer
1
CMI2019A7
An interschool basketball tournament is being held at the Olympic sports complex. There are multiple basketball courts. Matches are scheduled in parallel, with staggered timings, to ensure that spectators always have some match or other available to watch. Each match ... solve? Find a minimal colouring. Find a minimal spanning tree. Find a minimal cut. Find a minimal vertex cover.
asked
Sep 14, 2019
in
Graph Theory
by
gatecse

147
views
cmi2019
graphtheory
graphcoloring
spanningtree
vertexcover
descriptive
+1
vote
1
answer
2
MadeEasy Test Series 2019: Algorithms  Spanning Tree
Consider a simple undirected weighted graph G(V, E) with 10 vertices and 45 edge, assume (u, v) are two vertices weight of a edge is =4lu vl then the minimum cost of the spanning tree of G_ 36
asked
Jan 30, 2019
in
Algorithms
by
Ram Swaroop

350
views
algorithms
spanningtree
madeeasytestseries2019
madeeasytestseries
0
votes
3
answers
3
Ace test series question on number of spanning trees possible
asked
Jan 25, 2019
in
Algorithms
by
Shankar Kakde

214
views
spanningtree
0
votes
2
answers
4
GATE Minimum Spanning Trees
Q1) Why is the path between a pair of vertices in a minimum Spanning tree of an undirected graph not the shortest( minimum weight) path?
asked
Aug 31, 2018
in
Mathematical Logic
by
Nidhi Budhraja

253
views
minimumspanningtrees
spanningtree
graphtheory
graphalgorithms
algorithms
+1
vote
3
answers
5
Doubt
For a complete graph with 10 vertices, The number of spanning trees is at least_____?
asked
Aug 23, 2018
in
Graph Theory
by
Rishav Kumar Singh

182
views
spanningtree
+1
vote
1
answer
6
Made Easy algorithms
How many edge disjoint spanning trees are possible for a undirected complete connected graph of n vertices?
asked
Aug 14, 2018
in
Algorithms
by
Sambhrant Maurya

197
views
algorithms
spanningtree
graphtheory
+5
votes
1
answer
7
Number of spanning tress
How do we come up with this formula for number of spanning tree of a n vertex complete graph Kn= $n^{n2}$
asked
Mar 18, 2018
in
Algorithms
by
Mahendra Singh Kanya

385
views
spanningtree
algorithms
graphtheory
0
votes
4
answers
8
trees
Given a preorder, postorder and inorder traversal of a tree, is it always possible to obtain a tree that satisfies each of the three conditions? Or is it possible to not obtain a tree at all?
asked
Feb 19, 2018
in
DS
by
Parimal Paritosh

310
views
binarytree
algorithms
spanningtree
binarysearchtree
+3
votes
1
answer
9
#distinct MSTs
......................................................
asked
Jan 28, 2018
in
Algorithms
by
Tuhin Dutta

229
views
algorithms
mst
spanningtree
+6
votes
2
answers
10
Number of minimum spanning trees
asked
Jan 18, 2018
in
Graph Theory
by
vishal chugh

931
views
spanningtree
graphtheory
minimumspanningtrees
+2
votes
0
answers
11
TEST SERIES
Consider the following graph and Assume node ‘P’ as the starting vertex for Prim’s algorithm. Which of the following can be the correct order of edges to which they are added to construct Minimum Spanning Tree (MST)? PQ, QR, RW, RS, VX, VU, WV, ST PQ, QR, RW, WV, VX, VU, RS, ST PQ, PX, XV, VU, UR, RS, RW, ST PQ, PX, XV, VU, UR, RW, RS, ST PLEASE EXPLAIN.
asked
Jan 8, 2018
in
Algorithms
by
ankit_thawal

346
views
primsalgorithm
spanningtree
minimumspanningtrees
greedyalgorithm
+2
votes
0
answers
12
Ace Test series: Algorithms  Spanning Tree
Am getting 7. The answer given is 10. A  B , A  D , D  E , E  C are the edges i have included.
asked
Jan 6, 2018
in
Algorithms
by
smsubham

164
views
acetestseries
graphalgorithms
algorithms
spanningtree
minimumspanningtrees
+5
votes
1
answer
13
How many MST is possible?
Given graph using Prim’s or Kruskal’s algorithm, find out that how many distinct minimum cost spanning trees are possible___? My answer was 1 and given is 2 ,what I am missing ? Edit:I had confirmed with it and answer is only one tree possible.
asked
Jan 2, 2018
in
Algorithms
by
sunil sarode

637
views
algorithms
spanningtree
kruskalsalgorithm
primsalgorithm
+1
vote
0
answers
14
MadeEasy Test Series: Algorithms  Spanning Tree
can someone provide a detailed solution of this??
asked
Jan 1, 2018
in
Algorithms
by
Kalpataru Bose

301
views
madeeasytestseries
algorithms
graphalgorithms
spanningtree
minimumspanningtrees
greedyalgorithm
+3
votes
1
answer
15
Spannig trees
For a complete graph with 10 vertices, The number of spanning trees is at least_____?
asked
Nov 17, 2017
in
Graph Theory
by
Parshu gate

562
views
spanningtree
graphtheory
+3
votes
0
answers
16
Number of spanning Trees
Hi, As all of us knows number of spanning tree of simple labeled graph could be computed by the Kirchhoff's theorem. But is there any other method (other than Brute force) to compute the number of spanning tree of given general graph ? Formula for number ... respectively. If anyone can state simple proof for above mentioned formula then it will great help.
asked
Nov 15, 2017
in
Graph Theory
by
Chhotu

2.1k
views
spanningtree
algorithms
graphtheory
0
votes
1
answer
17
UGCNETdec2008ii3
The total number of spanning trees that can be drawn using five labeled vertices is: 125 64 36 16
asked
Sep 25, 2017
in
DS
by
rishu_darkshadow

683
views
ugcnetdec2008ii
datastructures
spanningtree
0
votes
1
answer
18
Basic Doubt in spanning tree complexity
Let us say Simple graph has V vertices and E edges. Now i am trying to find relation between E and V. If it is a complete graph ,then E=V(V1)/2, => E=$c.V^2$ => E=$O(V^2)$ => taking log of both sides. => $\log E$=$O(\log V)$ ... .(3) Can someone confirm if the 1 ,2 and the result of them i.e the 3rd equation is valid ?
asked
Sep 17, 2017
in
Algorithms
by
rahul sharma 5

221
views
spanningtree
timecomplexity
+1
vote
1
answer
19
[Discrete maths] Spanning trees
True/False; 1. Every tree is spanning tree.
asked
Sep 16, 2017
in
Graph Theory
by
rahul sharma 5

240
views
algorithms
spanningtree
minimumspanningtrees
+2
votes
2
answers
20
Graph Theory
Consider a 'reversed Kruskal' Algorithm for computing a MST. Initialize T to be the set of all edges in the graph. Now consider edges from largest to smallest cost. For each edge, delete it from T if that edge belongs to a cycle in T. Assuming all the edge costs are distinct, does this new algorithm correctly compute a MST? a) Yes b) no c) cant say
asked
Sep 14, 2017
in
Graph Theory
by
Rakshit Gupta

340
views
graphtheory
graphmatching
graphconnectivity
spanningtree
+1
vote
1
answer
21
How many Spanning Trees are possible from the graph?
How many Spanning Trees are possible from the graph given below? (a) 24 (b) 34 (c) 44 (d) 54
asked
May 4, 2017
in
Algorithms
by
targate2018

1.2k
views
algorithms
spanningtree
+1
vote
2
answers
22
No of spanning Trees
Let $K_n$ denote the complete undirected graph with $n$ vertices where n is an even number. Find the maximum number of spanning trees of $K_n$ that can be formed in such a way that no two of these spanning trees have a common edge.
asked
Mar 19, 2017
in
Graph Theory
by
dd

982
views
spanningtree
graphtheory
0
votes
1
answer
23
testbook
asked
Feb 7, 2017
in
Theory of Computation
by
Sarvottam Patel

146
views
spanningtree
–1
vote
3
answers
24
Virtual Gate Test Series: Algorithms  Minimum Spanning Tree
I think all options are wrong
asked
Jan 11, 2017
in
Algorithms
by
Purple

354
views
algorithms
spanningtree
minimumspanningtrees
primsalgorithm
virtualgatetestseries
+2
votes
2
answers
25
GATE19894vii
Provide short answers to the following questions: In the graph shown above, the depthfirst spanning tree edges are marked with a 'T'. Identify the forward, backward and cross edges.
asked
Dec 1, 2016
in
Graph Theory
by
makhdoom ghaya

477
views
gate1989
descriptive
graphtheory
spanningtree
dfs
+1
vote
1
answer
26
UGCNETAUG2016III: 33
Consider a weighted complete graph $G$ on the vertex set $\left\{ν_{1} , ν_{2},.... ν_{n} \right\}$ such that the weight of the edge $(ν_{i} , ν_{j})$ is $4  i – j$. The weight of minimum cost spanning tree of $G$ is : $4n^{2}$ $n$ $4n – 4$ $2n – 2$
asked
Oct 2, 2016
in
DS
by
makhdoom ghaya

369
views
ugcnetaug2016iii
datastructures
spanningtree
0
votes
0
answers
27
Virtual Gate Test Series: Algorithms  Spanning Tree
asked
Jul 16, 2016
in
Algorithms
by
debanjan sarkar

203
views
algorithms
spanningtree
minimumspanningtrees
virtualgatetestseries
+6
votes
4
answers
28
ISRO201541
The number of spanning trees for a complete graph with seven vertices is $2^5$ $7^5$ $3^5$ $2^{2 \times 5}$
asked
Jun 5, 2016
in
Algorithms
by
shivanisrivarshini

3.9k
views
isro2015
graphtheory
spanningtree
+1
vote
0
answers
29
ISI2012PCBCS4
A fan of order $n$ is a graph on the vertices $\{0, 1, \dots, n\}$ with $2n − 1$ edges defined as follows: vertex $0$ is connected by an edge to each of the other $n$ vertices, and vertex $i$ ... the number of spanning trees of the fan of order $n$. Calculate $f_4$. Write a recurrence for $f_n$. Solve for fn using ordinary generating functions.
asked
Jun 2, 2016
in
Graph Theory
by
jothee

253
views
descriptive
isi2012pcbcs
graphtheory
spanningtree
generatingfunctions
+1
vote
1
answer
30
ISI2014PCBCS3b
Let $G = (V, E)$ be an undirected weighted graph with all edge weights being positive. Design an efficient algorithm to find the maximum spanning tree of $G$.
asked
May 31, 2016
in
Algorithms
by
jothee

269
views
descriptive
isi2014pcbcs
algorithms
spanningtree
graphalgorithms
Page:
1
2
3
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
Recent Posts
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
PGEE 2020 (CSE) Experience
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.2k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged spanningtree
Recent Blog Comments
Very helpful. can't thank you enough! :) :)
@toxicdesire I don't remember the exact...
Will you please tell what they answered to your...
@commenter max marks for part A was 75. They did...
Hope you get selected bhaiya
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,345
questions
60,504
answers
201,903
comments
95,335
users