Virtual Labs

Tools

Aim

Theory

Procedure

Pretest

Demo

Practice

Posttest

References

Contributors

Feedback

Aim

Theory

Procedure

Pretest

Demo

Practice

Posttest

References

Contributors

Feedback

Depth First Search

Choose difficulty:

Beginner

Intermediate

Advanced

What kind of data structure does DFS use?

a: FIFO Queue Explanation

Explanation

b: LIFO Queue (Stack) Explanation

Explanation

c: Linked List Explanation

Explanation

d: Heap Explanation

Explanation

Does DFS find the shortest path to the goal node?

a: Yes Explanation

Explanation

b: No Explanation

Explanation

c: Sometimes Explanation

Explanation

d: Never Explanation

Explanation

What advantage does DFS have over BFS (Breadth First Search)?

a: Optimality Explanation

Explanation

b: Completeness Explanation

Explanation

c: Less Memory Usage (Space Complexity) Explanation

Explanation

d: Less Time Complexity Explanation

Explanation

Does DFS keep in memory all of the visited nodes?

a: Yes Explanation

Explanation

b: No Explanation

Explanation

When is DFS not complete?

a: When the goal node is not reachable from the source vertex Explanation

Explanation

b: When the state space is infinite Explanation

Explanation

c: Either a) or b) Explanation

Explanation

d: It is always complete 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)