Quiz3-TCS-5A-
Graph Algorithms Quiz
Welcome to the Graph Algorithms Quiz! Test your knowledge on edge disjoint paths, minimum cuts, and algorithm efficiency as you navigate through various questions. This quiz is designed for those interested in deepening their understanding of graph theory and related algorithms.
Key Features:
- 11 engaging questions
- Multiple choice format
- Test your expertise in graph algorithms
To find the all pair shortest paths in a graph using super vertex, we add some figure to the edge weights when
So that relative weights remain same
Dikjistra algorithm cannot run on negative weights
Which of the following can be found using minimum cut?
Edge disjoint paths
Edges needed to be removed
Minimum number of edge disjoint paths
All of these
For a graph with 3 vertices and 10 edges, the time to find 2 number of edge disjoint paths, the path finder will take time?
9
27
30
26
Considering the above diagram, if algo 5.2, 5.1 run, and find a pink path and then, green path, the minimum cut will include which of the following vertices
0,4,3
0,1,4
0,3
0,4
If the size of the minimum cut in the original graph is 3 , and its size is 2 in the resultant graph of algorithms 5.2 and 5.1 it implies:
There are 2 number of edges reversed
2 edge disjoint paths have been discovered
1 edge disjoint path has been discovered
Gives incomplete information.
After applying algo 5.2, the graph will never be disjoint even if we remove the edges that are cut by minimum cut.
True
False
All the vertices reachable from source vertex are kept in one set, and remaining in other set, this is done to?
To find the remaining path from source vertex
To find the minimum cut
To find the edge disjoint path
We will know that there are no edge disjoint paths left for algo 5.2 to discover when
Size of minimum cut is smaller than the size of minimum cut in resultant graph
Size of minimum cut is greater than size of minimum cut in resultant graph
When there are no more edges going out of the cut in resultant graph
When the edges cut in original graph is 4 in original graph, and the total edge disjoint paths discovered are 2, it implies
The cut is the minimum cut
There are 3 edge disjoint paths discovered
There are 4 edge disjoint paths
If the size of the minimum cut in original graph is 3, the pseudo edge disjoint path discovered in Resultant Graph F will be
4
3
2
Can be more than 3
{"name":"Quiz3-TCS-5A-", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Welcome to the Graph Algorithms Quiz! Test your knowledge on edge disjoint paths, minimum cuts, and algorithm efficiency as you navigate through various questions. This quiz is designed for those interested in deepening their understanding of graph theory and related algorithms.Key Features:11 engaging questionsMultiple choice formatTest your expertise in graph algorithms","img":"https:/images/course1.png"}