Informed Search and Exploration MCQs | Artificial Intelligence

By: Prof. Dr. Fazal Rehman | Last updated: April 29, 2025

11
Score: 0
Attempted: 0/11
Subscribe
1. Which of the following is the space complexity of Greedy search?



2. Which of the following is the evaluation function in the A* technique?



3. A* is optimal if h(n) is an allowable heuristic—that is, providing that h(n) under no circumstances underestimates the cost to reach the goal.



4. We can implement the Best First search with the help of which data structure?



5. A* algorithm is based on which of the following?



6. The search strategy that uses a problem-specific knowledge is commonly known as ____?



7. Greedy search strategy chooses the node for expansion in which of the following?



8. Best-First search is a type of informed search that uses which of the following to choose the best next node for expansion?



9. Heuristic function h(n) is …….?



10. A heuristic is a way of trying which of the following?



11. Which of the following is the evaluation function in the greedy technique?



Related Posts:

Leave a Comment

All Copyrights Reserved 2025 Reserved by T4Tutorials