Virtual Labs

Tools

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Search With Open and Closed List

Choose difficulty:

Beginner

Intermediate

Advanced

What is the Breadth First Search Algorithm used for??

a: To search the shortest path in a graph. Explanation

Explanation

b: To search the longest path in a graph. Explanation

Explanation

c: To search the most visited node in a graph. Explanation

Explanation

d: To search the most isolated node in a graph. Explanation

Explanation

Which data structure is used to store the nodes in the Breadth First Search Algorithm?

a: Stack Explanation

Explanation

b: Queue Explanation

Explanation

c: Heap Explanation

Explanation

d: Linked List Explanation

Explanation

What is the time complexity of the Breadth First Search Algorithm in the worst-case scenario?

a: O(log n) Explanation

Explanation

b: O(n) Explanation

Explanation

c: O(n log n) Explanation

Explanation

d: O(n^2) Explanation

Explanation

Which list is used to store the visited nodes in the Breadth First Search Algorithm?

a: Open List Explanation

Explanation

b: Closed List Explanation

Explanation

c: Queue List Explanation

Explanation

d: Priority List Explanation

Explanation

What happens when a node is visited in the Breadth First Search Algorithm?

a: The node is added to the open list. Explanation

Explanation

b: The node is removed from the open list. Explanation

Explanation

c: The node is added to the closed list. Explanation

Explanation

d: The node is removed from the closed list. Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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