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

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 the Binary Trees?

a: Pre-order Traversal Explanation

Explanation

b: Post-order Traversal Explanation

Explanation

c: Level-order Traversal Explanation

Explanation

d: In-order Traversa 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

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

Contact Us Phone: General Information: 011-26582050 Email: support@vlabs.ac.in

Follow Us

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