Virtual Labs

In a graph traversal problem, the goal node is located at a depth of 4. How many iterations of IDDFS would be needed to guarantee finding the goal node?

a: 3 Explanation

Explanation

b: 4 Explanation

Explanation

c: 5 Explanation

Explanation

d: 6 Explanation

Explanation

What happens when visited nodes are not kept track of in IDDFS?

a: The IDDFS algorithm will still find the optimal solution. Explanation

Explanation

b: The IDDFS algorithm may get stuck in an infinite loop. Explanation

Explanation

c: The IDDFS algorithm will terminate but may not find the optimal solution. Explanation

Explanation

d: The IDDFS algorithm will be faster but may miss some nodes. Explanation

Explanation

e: The IDDFS algorithm will not work at all and fail to find any solution. Explanation

Explanation

Consider the following graph: A->B, A->C, B->D, B->E, C->F. What will be the order of nodes visited in IDDFS starting from node A?

a: A, B, D, E, C, F Explanation

Explanation

b: A, B, C, D, E, F Explanation

Explanation

c: A, A, B, D, E, A, A, C, F Explanation

Explanation

d: A, A, B, C, A, B, D, E, C, F Explanation

Explanation

Consider the following graph: A->B, A->C, B->D, D->E. How many nodes will be visited before reaching node C in IDDFS and DFS?

a: IDDFS - 3, DFS - 3 Explanation

Explanation

b: IDDFS - 3, DFS - 4 Explanation

Explanation

c: IDDFS - 4, DFS - 3 Explanation

Explanation

d: IDDFS - 4, DFS - 4 Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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