Virtual Labs

Tools

Aim

Theory

Procedure

Pretest

Demo

Practice

Posttest

References

Contributors

Feedback

Aim

Theory

Procedure

Pretest

Demo

Practice

Posttest

References

Contributors

Feedback

Greedy Best First Search

Choose difficulty:

Beginner

Intermediate

Advanced

What does the term 'best' refer to in Best First Search (BFS)?

a: The best path found so far in the search space. Explanation

Explanation

b: The best heuristic function used for evaluation. Explanation

Explanation

c: The best node to expand based on the evaluation function. Explanation

Explanation

d: The best order of exploring nodes in the search space. Explanation

Explanation

Which factor influences the efficiency of Best First Search (BFS)?

a: The choice of the heuristic function Explanation

Explanation

b: The size of the search space Explanation

Explanation

c: The ordering of expanded nodes Explanation

Explanation

d: The initial state of the problem Explanation

Explanation

What is the time complexity of Best First Search (BFS) in the worst-case scenario?

a: O(m^b) Explanation

Explanation

b: O(b^m) Explanation

Explanation

c: O(b+m) Explanation

Explanation

d: O(bm) Explanation

Explanation

Which of the following heuristic functions is admissible in Best-First Search?

a: Overestimating the cost from the current node to the goal node Explanation

Explanation

b: Underestimating the cost from the current node to the goal node Explanation

Explanation

c: Always assigning a heuristic value of zero to all nodes Explanation

Explanation

d: Assigning a random heuristic value to each node Explanation

Explanation

Which property does Best First Search (BFS) guarantee to find?

a: Completeness Explanation

Explanation

b: Optimality Explanation

Explanation

c: Admissibility Explanation

Explanation

d: None of the above Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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