GATE 2016 · CS1 - Forenoon
Let G be a complete undirected graph on 4 vertices, having 6 edges with weights 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is _______
Related Algorithms PYQs
Consider the directed acyclic graph with edges: a->b, b->c, c->f, a->d, d->e, e->f. The number of different topological orderings …
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same …
Consider the weighted graph with distance matrix W: W = \[\begin{bmatrix}0 & 2 & 8 & 5\\2 & 0 & 5 & 8\\8 & 5 & 0 & x\\5 & 8 & x & …
G = (V, E) is an undirected simple graph with distinct edge weights, and e is a particular edge. Which statements about MSTs of G …
Queue Q contains 16 numbers and S is an empty stack. Algorithm: while Q is not Empty do if S is Empty OR Top(S) <= Head(Q) the…
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.