1
GATE CSE 2004
+2
-0.6
Suppose we run Dijkstra’s single source shortest-path algorithm on the following edge-weighted directed graph with vertex P as the source.
In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized?
A
$$P,Q,R,S,T,U$$
B
$$P,Q,R,U,S,T$$
C
$$P,Q,R,U,T,S$$
D
$$P,Q,T,R,U,S$$
2
GATE CSE 2003
+2
-0.6
Let G=(V,E) be an undirected graph with a subgraph G1=(V1,E1). Weights are assigned to edges of G as follows. $$w(e) = \begin{cases} 0 \text{, if } e \in E_1 \\1 \text{, otherwise} \end{cases}$$$A single-source shortest path algorithm is executed on the weighted graph (V,E,w) with an arbitrary vertex v1 of V1 as the source. Which of the following can always be inferred from the path costs computed? A The number of edges in the shortest paths from v1 to all vertices of G B G1 is connected C V1 forms a clique in G D G1 is a tree 3 GATE CSE 2003 MCQ (Single Correct Answer) +2 -0.6 Let G = (V, E) be a directed graph with n vertices. A path from vi to vj in G is sequence of vertices (vi, vi+1, ……., vj) such that (vk, vk+1) ∈ E for all k in i through j – 1. A simple path is a path in which no vertex appears more than once. Let A be an n x n array initialized as follow $$A[j,k] = \left\{ {\matrix{ {1\,if\,(j,\,k)} \cr {1\,otherwise} \cr } } \right.$$$ Consider the following algorithm.
for i = 1 to n
for j = 1 to n
for k = 1 to n
A [j , k] = max (A[j, k] (A[j, i] + A [i, k]); 
Which of the following statements is necessarily true for all j and k after terminal of the above algorithm ?
A
$$A\left[ {j,{\rm{ }}k} \right]{\rm{ }} \le {\rm{ }}n$$
B
If $${\rm{A[j, k] = n }} - 1$$, then G has a Hamiltonian cycle
C
If there exists a path from j to k, A[j, k] contains the longest path lens from j to k
D
If there exists a path from j to k, every simple path from j to k contain most A[j, k] edges
4
GATE CSE 2003
+2
-0.6
What is the weight of a minimum spanning tree of the following graph?
A
29
B
31
C
38
D
41
GATE CSE Subjects
EXAM MAP
Medical
NEET