In quick sort, for sorting n elements, the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. What is the…
Which one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal's algorithm?
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…
Let G(V,E) be a simple, undirected, edge-weighted graph with unique edge weights. Which of the following statements about the mini…
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.