Virtual Labs

a: Random Search always finds the shortest path. b: Random Search does not follow a systematic order, while DFS does. c: Random Search uses heuristics, while DFS does not. d: Random Search guarantees an optimal solution.

Which of the following best describes Random Search?

a: A deterministic search method. b: A heuristic-based search method. c: A non-deterministic method that chooses paths randomly. d: A method that always explores all nodes.

In Random Search, what happens if the algorithm reaches a dead-end?

a: It backtracks systematically to the previous node. b: It chooses another path randomly from the start or remaining unexplored nodes. c: It terminates immediately without finding the goal. d: It guarantees finding the goal by retrying.

Why is Random Search often considered as a baseline algorithm?

a: Because it is the fastest algorithm for graph traversal. b: Because it ensures the most optimal path. c: Because it is simple and can be compared against advanced methods. d: Because it requires heuristics to work.

Which of the following is a limitation of Random Search?

a: It is too complex to implement. b: It cannot be applied to optimization problems. c: It may fail to find the goal or return a non-optimal path. d: It requires heavy memory usage.

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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