Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged minimum-spanning-tree
1
vote
1
answer
1
GO Classes 2023 | IIITH Mock Test 3 | Question: 15
Consider a undirected graph $G$ with $n$ vertices and every edge weight being distinct. Edge $e_1$ is edge with minimum weight and edge $e_2$ is edge with maximum weight. Then, which of the following is/are FALSE? (Mark all the ... No minimum spanning tree contains $e_2$ $G$ has a unique minimum spanning tree if $e_2$ is in a minimum spanning tree
GO Classes
asked
in
Algorithms
Apr 15
by
GO Classes
226
views
goclasses2023-iiith-mock-3
goclasses
algorithms
minimum-spanning-tree
multiple-selects
1-mark
2
votes
1
answer
2
GO Classes 2023 | IIITH Mock Test 2 | Question: 64
The following diagram shows the set of edges (in thick black lines) selected at some intermediate step of an MST algorithm. Lighter edges are not yet in MST. Assume that we got above the intermediate state using Kruskal’s algorithm. What would be the maximum value of $x+y-z ?$ $100$ $110$ $120$ $130$
GO Classes
asked
in
Algorithms
Apr 8
by
GO Classes
308
views
goclasses2023-iiith-mock-2
goclasses
algorithms
graph-algorithms
minimum-spanning-tree
1-mark
1
vote
2
answers
3
GO Classes 2023 | IIITH Mock Test 1 | Question: 11
Suppose that a MST of the following edge-weighted graph contains the edges with weights $x, y$, and $z$. What will be the maximum value of $x+y+z?$ $200$ $250$ $300$ $350$
GO Classes
asked
in
Algorithms
Mar 26
by
GO Classes
299
views
goclasses2023-iiith-mock-1
goclasses
algorithms
minimum-spanning-tree
1-mark
0
votes
1
answer
4
TestBook testseries question to find max weight of MST
A complete graph G with 5 nodes has positive weight edges, each node has a distinct weight with an integer value and maximum weight is equal to number of edges in G. What can be the maximum weight of minimum spanning tree for graph G?
Sahil_Lather
asked
in
Algorithms
Jan 28
by
Sahil_Lather
186
views
algorithms
minimum-spanning-tree
testbook-test-series
2
votes
0
answers
5
Why does Kruskal's algorithm find the minimum spanning tree if it's greedy? Isn't a minimum spanning tree a global optimization problem? Isn't the point of being greedy is that there is a chance you won't find the most optimal solution? So how can Kruskal be able to find the minimum spanning tree while also being greedy?
sandip_1999
asked
in
Algorithms
May 11, 2022
by
sandip_1999
316
views
kruskals-algorithm
prims-algorithm
minimum-spanning-tree
12
votes
1
answer
6
GATE CSE 2022 | Question: 39
Consider a simple undirected weighted graph $\textit{G},$ all of whose edge weights are distinct. Which of the following statements about the minimum spanning trees of $\textit{G}$ is/are $\text{TRUE}?$ The edge with the second smallest weight is ... always be part of any minimum spanning tree of $\textit{G}.$ $\textit{G}$ can have multiple minimum spanning trees.
Arjun
asked
in
Algorithms
Feb 15, 2022
by
Arjun
6.7k
views
gatecse-2022
algorithms
spanning-tree
minimum-spanning-tree
multiple-selects
2-marks
0
votes
1
answer
7
made easy test series - minimum spanning tree
How many minimum spanning trees are possible in this graph?
atulcse
asked
in
Algorithms
Jan 13, 2022
by
atulcse
370
views
minimum-spanning-tree
algorithms
numerical-answers
0
votes
1
answer
8
NPTEL Assignment Question
Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change P only Q only Neither P nor Q Both P and Q
rsansiya111
asked
in
Algorithms
Dec 7, 2021
by
rsansiya111
372
views
nptel-quiz
graph-algorithms
minimum-spanning-tree
shortest-path
5
votes
1
answer
9
Applied Test Series
Given the following undirected graph, the cost of the minimal spanning tree of the graph is ____.
LRU
asked
in
Algorithms
Nov 5, 2021
by
LRU
434
views
algorithms
minimum-spanning-tree
applied-gate-test-series
numerical-answers
Page:
1
2
3
4
5
6
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
IIITA M.TECH IT COMPLETE EXPLANATION FROM ADMISSION TO PLACEMENT
GO Classes NIELIT Test Series For 2023
Interview Experience : MTech Research(Machine Learning) at IIT Mandi
DRDO Scientist -B
ISRO Scientist-B 2023
Subjects
All categories
General Aptitude
(2.8k)
Engineering Mathematics
(9.8k)
Digital Logic
(3.4k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.4k)
Others
(2.5k)
Admissions
(667)
Exam Queries
(1.0k)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(867)
Recent questions tagged minimum-spanning-tree
Recent Blog Comments
This story is same like my tier 3 college btech...
@Nikhil_dhamaHi , now i am in 2nd semester...
You can attempt now:...
where is the free test link ? how i can attempt...
Left with 10days, nothing heard back from them,...