Home > Artificial Intelligence > Quizzes > Artificial Intelligence Practice Test Questions: Problem Solving
Artificial Intelligence Practice Test Questions: Problem Solving
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 82% • Most missed: “When is breadth-first search is optimal?”

Topics include: Problem Solving, Uninformed Search Strategy, Uninformed Search and Exploration, Informed Search Strategy, Informed Search and Exploration, Local Search Problems and Optimization Problems, & Constraints Satisfaction Problems.

 

Artificial Intelligence Practice Test Questions: Problem Solving
Time left 00:00
25 Questions

1. A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum.
2. Strategies that know whether one non-goal state is “more promising” than another are called ___________
3. How many types are available in uninformed search method?
4. Searching using query on Internet is, use of ___________ type of agent.
5. Which data structure conveniently used to implement BFS?
6. Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.
7. Which method is used to search better by learning?
8. Which search is complete and optimal when h(n) is consistent?
9. When will Hill-Climbing algorithm terminate?
10. How many parts does a problem consists of?
11. A search algorithm takes _________ as an input and returns ________ as an output.
12. What are the main cons of hill-climbing search?
13. Hill-Climbing approach stuck for which of the following reasons?
14. Which of the following algorithm is generally used CSP search algorithm?
15. The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.
16. Which search uses only the linear space for searching?
17. Though local search algorithms are not systematic, key advantages would include __________
18. What is the heuristic function of greedy best-first search?
19. What is the evaluation function in A* approach?
20. Uninformed search strategies are better than informed search strategies.
21. A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state.
22. The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.
23. Which search strategy is also called as blind search?
24. When do we call the states are safely explored?
25. Which is the best way to go for Game playing problem?

⚡ Recently practiced quizzes in this topic
Live quiz activity
Artificial Intelligence Practice Test Questions: Adversarial Search Natural Language Processing (NLP) Basics Test Soft Computing Practice Test Questions Artificial Intelligence Fundamentals: Introduction to Artificial Intelligence Practice Test Artificial Intelligence: Search Techniques CBSE Class 10 Natural Language Processing AI-417 Practice Test Artificial Intelligence Practice Test Questions: Planning and Acting in the Real World Artificial Intelligence & Soft Computing: Expert System Neural Network Practice Test: Feedforward Neural Networks Artificial Intelligence Practice Test Questions 3
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.