The characters a to h have the set of frequencies based on the first 8 Fibonacci numbers as follows: a:1, b:1, c:2, d:3, e:5, f:8,…
Let s and t be two vertices in an undirected graph G=(V, E) having distinct positive edge weights. Let [X, Y] be a partition of V …
An undirected graph G has n nodes. Its adjacency matrix is given by an n x n square matrix whose (i) diagonal elements are 0's and…
Consider the following graph with 6 vertices {a, b, c, d, e, f}. Which one of the following cannot be the sequence of edges added,…
What is the worst-case time complexity of Floyd-Warshall all-pairs shortest paths algorithm on a graph with n vertices?
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)\…
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.