National Institute of Technology, Kurukshetra

B. Tech (4th year) Information Technology

Advance Data Structure (IT-401)
Tutorial-4

Q-1 The Floyd-Warshall algorithm for all-pair shortest paths computation is based on:
(A) Greedy paradigm.
(B) Divide-and-Conquer paradigm.
(C) Dynamic Programming paradigm.
(D) neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.
Q-2 Consider the DAG with Consider V = {1, 2, 3, 4, 5, 6}, shown below. Which of the following
is NOT a topological ordering?
(A) 1 2 3 4 5 6
(B) 1 3 2 4 5 6
(C) 1 3 2 4 6 5
(D) 3 2 4 1 6 5
Q-3 If G is a forest with n-vertices and k connected components, how many edges does G have?
Q-4 In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of
the following statements is True?
(A) A tree has no bridge
(B) A bridge cannot be part of a simple cycle
(C) Every edge of a clique with size ≥ 3 is a bridge (A clique is any complete subgraph of a graph)
(D) A graph with bridges cannot have a cycle
Q-5 Minimum number of colors that is sufficient to vertex-color any cycle on n nodes?
Q-6 What is an articulation point, how to find all articulation points in a graph, what is the
complexity of best algorithm to find it?