Virtual Labs

Tools

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Perform and visualize Depth First Search

Choose difficulty:

Beginner

Intermediate

Advanced

Depth 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

Time Complexity of DFS is? (V – number of vertices, E – number of edges)

a: O(V*E) Explanation

Explanation

b: O(V) Explanation

Explanation

c: O(E) Explanation

Explanation

d: O(V + E) Explanation

Explanation

Depth First Search graph search algorithm uses ______ data structure implementation

a: Dequeue Explanation

Explanation

b: Queue Explanation

Explanation

c: Tree Explanation

Explanation

d: Stack Explanation

Explanation

The Depth 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 Depth First Search?

a: For generating topological sort of a graph Explanation

Explanation

b: For generating Strongly Connected Components of a directed graph Explanation

Explanation

c: Peer to Peer Networks Explanation

Explanation

d: Detecting cycles in the graph Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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