Algorithms
Quick practice
Question 1 of 5
In the spanning tree shown, what will be the minimum cost?
A
27
B
23
C
25
D
21
Concepts
Algorithms
Recurrence Relations
Divide and Conquer
Applications of Greedy Techniques
Single Source Shortest Path
Graph Based Algorithm
Dynamic Programming
Get unlimited practice with GATE & ESE - ME & CH subscription
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go