Home > Artificial Intelligence > Quizzes > Artificial Intelligence & Soft Computing: Problem Solving
Artificial Intelligence & Soft Computing: Problem Solving
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 50% • Most missed: “Which is used to improve the performance of heuristic search?”
Artificial Intelligence & Soft Computing: Problem Solving
Time left 00:00
25 Questions

1. Which search uses the problem specific knowledge beyond the definition of the problem?
2. When is breadth-first search is optimal?
3. In many problems the path to goal is irrelevant, this class of problems can be solved using ____________
4. Which function will select the lowest expansion node at first for evaluation?
5. What is the other name of informed search strategy?
6. Which search strategy is also called as blind search?
7. 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.
8. What are the two main features of Genetic Algorithm?
9. A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum.
10. Though local search algorithms are not systematic, key advantages would include __________
11. _______________ Is an algorithm, a loop that continually moves in the direction of increasing value .
12. Which search uses only the linear space for searching?
13. How many parts does a problem consists of?
14. How many successors are generated in backtracking search?
15. Which search is complete and optimal when h(n) is consistent?
16. What is the heuristic function of greedy best-first search?
17. Which search implements stack operation for searching the states?
18. When will Hill-Climbing algorithm terminate?
19. What are the main cons of hill-climbing search?
20. What is the space complexity of Depth-first search?
21. Which search method will expand the node that is closest to the goal?
22. Which search is implemented with an empty first-in-first-out queue?
23. How many types are available in uninformed search method?
24. Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move.
25. Which is used to improve the performance of heuristic search?

⚡ 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.