161.  What can be the applications of Breadth First Search? 
Answer: (d).All of the mentioned

162.  When the Breadth First Search of a graph is unique? 
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) 
Answer: (c).At most 1

164.  In BFS, how many times a node is visited? 
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? 
Answer: (d).All of the above

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

167.  Possible number of labelled simple Directed, Pseudo and Multigarphs exist having 2 vertices? 
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) 
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 ___________ 
Answer: (c).(n*nn2*m)/2
