MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 8 Mcqs, each offering curated multiple-choice questions to sharpen your Artificial Intelligence knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What are the two main features of Genetic Algorithm? |
| A. | Fitness function & Crossover techniques |
| B. | Crossover techniques & Random mutation |
| C. | Individuals among the population & Random mutation |
| D. | Random mutation & Fitness function |
| Answer» B. Crossover techniques & Random mutation | |
| 2. |
Hill-Climbing approach stuck for which of the following reasons? |
| A. | Local maxima |
| B. | Ridges |
| C. | Plateaux |
| D. | All of the mentioned |
| Answer» E. | |
| 3. |
What are the main cons of hill-climbing search? |
| A. | Terminates at local optimum & Does not find optimum solution |
| B. | Terminates at global optimum & Does not find optimum solution |
| C. | Does not find optimum solution & Fail to find a solution |
| D. | Fail to find a solution |
| Answer» B. Terminates at global optimum & Does not find optimum solution | |
| 4. |
When will Hill-Climbing algorithm terminate? |
| A. | Stopping criterion met |
| B. | Global Min/Max is achieved |
| C. | No neighbor has higher value |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 5. |
_______________ Is an algorithm, a loop that continually moves in the direction of increasing value that is uphill. |
| A. | Up-Hill Search |
| B. | Hill-Climbing |
| C. | Hill algorithm |
| D. | Reverse-Down-Hill search |
| Answer» C. Hill algorithm | |
| 6. |
A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 7. |
Though local search algorithms are not systematic, key advantages would include __________ |
| A. | Less memory |
| B. | More time |
| C. | Finds a solution in large infinite space |
| D. | Less memory & Finds a solution in large infinite space |
| Answer» E. | |
| 8. |
In many problems the path to goal is irrelevant, this class of problems can be solved using ____________ |
| A. | Informed Search Techniques |
| B. | Uninformed Search Techniques |
| C. | Local Search Techniques |
| D. | Informed & Uninformed Search Techniques |
| Answer» D. Informed & Uninformed Search Techniques | |