Consider the following three functions. f1 = \(10^{n}\) f2 = n^(log n) f3 = \(n^{sqrt}\)(n) Which one of the following opt…
Consider the following array: 23 32 45 69 72 73 89 97 Which algorithm out of the following options uses the least number of compar…
Consider the following recurrence relation. T(n) = T(n/2) + T(2n/5) + 7n, if n > 0; T(n) = 1, if n = 0 Which one of the following …
Let G = (V,E) be an undirected unweighted connected graph. The diameter of G is defined as: diam(G) = max over u,v in V of {the le…
Define Rn to be the maximum amount earned by cutting a rod of length n meters into one or more pieces of integer length and sellin…
An articulation point in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the 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.