Time Left - 15:00 mins
GATE CS 2021 : Algorithm 6
Attempt now to get your rank among 588 students!
Question 1
Which of the following is correct statement?
Question 2
The time complexity of prims algorithm without using min heap approach will be?
Question 3
The graph shown below has distinct edge weights and MST of weight 40 and MST contain edges
{(A, C), (B, C), (B, E), (E, F), (D, F)}. The minimum possible sum of weights of all 8 edges of this graph is _____.
Question 4
If we run Dijkstra algorithm on vertex S to the following graph, then which of the following is shortest path distance from S to t
Question 5
Consider the following graph :
If Dijkstra algorithm is implemented on the above graph , then what is the order of edges visited during the execution of Dijkstra algorithm ?
If Dijkstra algorithm is implemented on the above graph , then what is the order of edges visited during the execution of Dijkstra algorithm ?
Question 6
Consider the following statement regarding Kruskal and Prim’s Algorithm for generating minimum spanning tree:
S1: While generating MST, it is possible to obtain forest during execution of the algorithm.
S2: The time complexity for generating MST is O (ElogE).
Which of the following is true for Kruskal algorithm but not Prim’s algorithm?
- 588 attempts
- 3 upvotes
- 3 comments
Tags :
GATE & PSU CSAlgorithmsApr 8GATE & PSU CS