Let G be any undirected graph with positive edge weights, and T be a minimum spanning tree of G. For any two vertices, u and v, le…
Consider the following recurrence relation: T(n) = 2T(n-1) + n*\(2^{n}\) for n > 0, T(0) = 1. Which ONE of the following options i…
The pseudocode of a function fun() is given below: ```text fun(int A[0,...,n-1]){ for i=0 to n-2 for j=0 to n-i-2 if (…
Let G(V,E) be an undirected and unweighted graph with 100 vertices. Let d(u,v) denote the number of edges in a shortest path betwe…
Consider an unordered list of N distinct integers. What is the minimum number of element comparisons required to find an integer i…
Which of the following statements regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph …
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.