GATE 2020
Consider a graph G = (V, E), where V = {v1, v2, ..., v100}, E = { (vi, vj) | 1 <= i < j <= 100 }, and weight of edge (vi, vj) is |i - j|. The weight of minimum spanning tree of G is _______
Related Algorithms PYQs
For parameters a and b, both of which are ω(1), T(n) = T(n^(1/a)) + 1, and T(b) = 1. Then T(n) is:
Let G = (V, E) be a weighted undirected graph and let T be a Minimum Spanning Tree (MST) of G maintained using adjacency lists. Su…
Let G = (V, E) be a directed, weighted graph with weight function w: E -> R. For some function f: V -> R, for each edge (u, v) ∈ E…
Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, requi…
Consider the following recurrence relations: for all n > 1, T1(n) = 4*T1(n/2) + T2(n), and T2(n) = 5*T2(n/4) + \(\Theta(\log_2 n)\…
Let G(V,E) be an undirected, edge-weighted graph with integer weights. The weight of a path is the sum of the weights of the edges…
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.