GATE 1991
Which algorithmic paradigm is used by the Floyd-Warshall algorithm for all-pairs shortest paths?
Related Algorithms PYQs
What is the solution to recurrence T(n) = T(n - 1) + 1 with T(1) = 1 for n = 50?
The asymptotic upper bound of an algorithm is mathematically represented by:
Which asymptotic notation represents a strict (tight) upper bound that is not asymptotically tight?
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…
Let G(V,E) be a simple, undirected graph. A vertex cover of G is a subset V' subset of V such that for every (u,v) in E, u in V' o…
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.