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 is the evaluation function in A* approach? |
| A. | Heuristic function |
| B. | Path cost from start node to current node |
| C. | Path cost from start node to current node + Heuristic cost |
| D. | Average of Path cost from start node to current node and Heuristic cost |
| Answer» D. Average of Path cost from start node to current node and Heuristic cost | |
| 2. |
What is the evaluation function in greedy approach? |
| A. | Heuristic function |
| B. | Path cost from start node to current node |
| C. | Path cost from start node to current node + Heuristic cost |
| D. | Average of Path cost from start node to current node and Heuristic cost |
| Answer» B. Path cost from start node to current node | |
| 3. |
Greedy search strategy chooses the node for expansion in ___________ |
| A. | Shallowest |
| B. | Deepest |
| C. | The one closest to the goal node |
| D. | Minimum heuristic cost |
| Answer» D. Minimum heuristic cost | |
| 4. |
Heuristic function h(n) is ________ |
| A. | Lowest path cost |
| B. | Cheapest path from root to goal node |
| C. | Estimated cost of cheapest path from root to goal node |
| D. | Average path cost |
| Answer» D. Average path cost | |
| 5. |
The name best-first search is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the goal. All we can do is choose the node that appears to be best according to the evaluation function. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 6. |
The search strategy the uses a problem specific knowledge is known as ___________ |
| A. | Informed Search |
| B. | Best First Search |
| C. | Heuristic Search |
| D. | All of the mentioned |
| Answer» E. | |
| 7. |
A* algorithm is based on ___________ |
| A. | Breadth-First-Search |
| B. | Depth-First Search |
| C. | Best-First-Search |
| D. | Hill climbing |
| Answer» D. Hill climbing | |
| 8. |
A heuristic is a way of trying ___________ |
| A. | To discover something or an idea embedded in a program |
| B. | To search and measure how far a node in a search tree seems to be from a goal |
| C. | To compare two nodes in a search tree to see if one is better than another |
| D. | All of the mentioned |
| Answer» E. | |