A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

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
View Answer Report Discuss Too Difficult!
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
View Answer Report Discuss Too Difficult!
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
View Answer Report Discuss Too Difficult!
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
View Answer Report Discuss Too Difficult!
Answer: (c).equivalent to number of indegree of the node