161. What can be the applications of Breadth First Search?
a. Finding shortest path between two nodes
b. Finding bipartiteness of a graph
c. GPS navigation system
d. All of the mentioned
Answer: (d).All of the mentioned

162. When the Breadth First Search of a graph is unique?
a. When the graph is a Binary Tree
b. When the graph is a Linked List
c. When the graph is a n-ary Tree
d. None of the mentioned
Answer: (b).When the graph is a Linked List

163. Regarding implementation of Breadth First Search using queues, what is the maximum distance between two nodes present in the queue? (considering each edge length 1)
a. Can be anything
b. 0
c. At most 1
d. Insufficient Information
Answer: (c).At most 1

164. In BFS, how many times a node is visited?
a. Once
b. Twice
c. equivalent to number of indegree of the node
d. None of the mentioned
Answer: (c).equivalent to number of indegree of the node

165. Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?
a. In adjacency list representation, space is saved for sparse graphs.
b. DFS and BSF can be done in O(V + E) time for adjacency list representation. These operations take O(V²) time in adjacency matrix representation. Here is V and E are number of vertices and edges respectively.
c. Adding a vertex in adjacency list representation is easier than adjacency matrix representation.
d. All of the above
Answer: (d).All of the above

166. What is the maximum number of edges in a bipartite graph having 10 vertices?
a. 24
b. 21
c. 25
d. 16
Answer: (c).25

167. Possible number of labelled simple Directed, Pseudo and Multigarphs exist having 2 vertices?
a. 3, Infinite, 4
b. 4, 3, Infinite
c. 4, Infinite, infinite
d. 4, Infinite, Infinite
Answer: (d).4, Infinite, Infinite

168. The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity.

(A) O(n)
(B) O(m)
(C) O(m + n)
(D) O(mn)
a. A
b. B
c. C
d. D
Answer: (c).C

169. If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________
a. (n*n-n-2*m)/2
b. (n*n+n+2*m)/2
c. (n*n-n-2*m)/2
d. (n*n-n+2*m)/2
Answer: (c).(n*n-n-2*m)/2