GATE 2018
Consider the given undirected graph G. Choose a value for edge weight x that will maximize the number of Minimum Weight Spanning Trees (MWSTs) of G. The number of MWSTs of G for this value of x is _______
Related Algorithms PYQs
Let G be a simple undirected graph. Let T_D be a depth first search tree of G. Let T_B be a breadth first search tree of G. Consid…
Consider a matrix multiplication chain F1 F2 F3 F4 F5, where matrices F1, F2, F3, F4 and F5 are of dimensions 2x25, 25x3, 3x16, 16…
Consider the following pseudo-code function: ```c Count(x, y) { if (y != 1) { if (x != 1) { print("*"); …
Consider items with (Weight, Value): Item 1 (10 kg, Rs 60), Item 2 (7 kg, Rs 28), Item 3 (4 kg, Rs 20), Item 4 (2 kg, Rs 24). Knap…
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.