Virtual Labs

Tools

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Contributors

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Contributors

Feedback

Perform and visualize Depth First Search

Choose difficulty:

Beginner

Intermediate

Advanced

DFS is a

a: traversal algorithm Explanation

Explanation

b: search algorithm Explanation

Explanation

c: both Explanation

Explanation

d: none Explanation

Explanation

Depth First Search is equivalent to which of the traversal in 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

The data structure used in standard implementation of Breadth First Search is?

a: Stack Explanation

Explanation

b: Queue Explanation

Explanation

c: Linked List Explanation

Explanation

d: Array Explanation

Explanation

Which data structure is commonly used for implementing DFS?

a: Queue Explanation

Explanation

b: Stack Explanation

Explanation

c: Heap Explanation

Explanation

d: Graph Explanation

Explanation

DFS can be used to detect which of the following in a graph?

a: Cycles Explanation

Explanation

b: Shortest path Explanation

Explanation

c: All leaf nodes Explanation

Explanation

d: Graph degree Explanation

Explanation

DFS can be applied to which type of graph traversal?

a: Directed graphs only Explanation

Explanation

b: Undirected graphs only Explanation

Explanation

c: Both directed and undirected graphs Explanation

Explanation

d: Weighted graphs only Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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