Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal. Which of the following statements is always true?

Which of the following is NOT a characteristic of dynamic programming?

For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?

In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity by

Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false? 

Which of the following statement is correct?

P1: Every tree will always be a graph

You are given a rod of length 5 and the prices of each length are as follows:

length         price
   1		  2
   2		  5
   3		  6
   4		  9
   5		  9

What is the maximum value that you can get after cutting the rod and selling the pieces?

Consider a graph G=(V, E), where V = { v1,v2,…,v100 }, E={ (vi, vj) ∣ 1≤ i < j ≤ 100} and weight of the edge (vi, vj)  is ∣i–j∣. The weight of minimum spanning tree of G is ________.

Dijkstra’s single source shortest path algorithm when run from vertex 'a' in the below graph, computes the correct shortest path distance to

Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to a vertex j if either j = i + 1 or j = 3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is