Quick practice
Question 1 of 5
In the spanning tree shown, what will be the minimum cost?
A
25
B
21
C
23
D
27
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 - CSIT, DSAI & Interview Preparation 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