Graphs Questions

MCQ bookmark_border

151.

Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)

A

O(V + E)

B

O(V)

C

O(E)

D

None of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

152.

The Breadth First Search traversal of a graph will result into?

A

Linked List

B

Tree

C

Graph with back edges

D

All of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

153.

A person wants to visit some places. He starts from a vertex and then wants to visit every place connected to this vertex and so on. What algorithm he should use?

A

Depth First Search

B

Breadth First Search

C

Trim

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

154.

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

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

155.

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

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

156.

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

C

At most 1

D

Insufficient Information

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

157.

In Breadth First Search, 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

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion