Virtual Labs

Tools

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Perform and Visualize Breadth First Traversal

Choose difficulty:

Beginner

Intermediate

Advanced

Breadth First Search is equivalent to which of the traversal in the Binary Trees?

a: Pre-order Traversal Explanation

Explanation

b: Post-order Traversal Explanation

Explanation

c: Level-order Traversal Explanation

Explanation

d: In-order Traversal Explanation

Explanation

When the Breadth First Search of a graph is unique?

a: When the graph is a Binary Tree Explanation

Explanation

b: When the graph is a Linked List Explanation

Explanation

c: When the graph is a n-ary Tree Explanation

Explanation

d: When the graph is a Ternary Tree Explanation

Explanation

In BFS, how many times a node is visited?

a: Once Explanation

Explanation

b: Twice Explanation

Explanation

c: Equivalent to number of indegree of the node Explanation

Explanation

d: Thrice Explanation

Explanation

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

a: Linked List Explanation

Explanation

b: Array Explanation

Explanation

c: Graph with back edges Explanation

Explanation

d: Tree Explanation

Explanation

Which of the following is not an application of Breadth First Search?

a: Finding shortest path between two nodes Explanation

Explanation

b: Path finding Explanation

Explanation

c: Finding bipartiteness of a graph Explanation

Explanation

d: GPS navigation system Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)