MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 20 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. |
The process of removing detail from a given state representation is called______ |
| A. | Extraction |
| B. | Abstraction |
| C. | Information Retrieval |
| D. | Mining of data |
| Answer» C. Information Retrieval | |
| 2. |
The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 3. |
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. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
_______________ 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 | |
| 5. |
Constraint Propagation technique actually modifies the CSP problem. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 6. |
A_PROBLEM_SOLVING_APPROACH_WORKS_WELL_FOR?$ |
| A. | 8-Puzzle problem |
| B. | 8-queen problem |
| C. | Finding a optimal path from a given source to a destination |
| D. | Mars Hover (Robot Navigation) |
| Answer» E. | |
| 7. |
Web Crawler is a/an$ |
| A. | Intelligent goal-based agent |
| B. | Problem-solving agent |
| C. | Simple reflex agent |
| D. | Model based agent |
| Answer» B. Problem-solving agent | |
| 8. |
The_________is_a_touring_problem_in_which_each_city_must_be_visited_exactly_once._The_aim_is_to_find_the_shortest_tour.$ |
| A. | Finding shortest path between a source and a destination |
| B. | Travelling Salesman problem |
| C. | Map coloring problem |
| D. | Depth first search traversal on a given map represented as a graph |
| Answer» C. Map coloring problem | |
| 9. |
Which is the best way to go for Game playing problem? |
| A. | Linear approach |
| B. | Heuristic approach (Some knowledge is stored) |
| C. | Random approach |
| D. | An Optimal approach |
| Answer» C. Random approach | |
| 10. |
Which search method takes less memory? |
| A. | Depth-First Search |
| B. | Breadth-First search |
| C. | Linear Search |
| D. | Optimal search |
| Answer» B. Breadth-First search | |
| 11. |
A production rule consists of |
| A. | A set of Rule |
| B. | A sequence of steps |
| C. | Set of Rule & sequence of steps |
| D. | Arbitrary representation to problem |
| Answer» D. Arbitrary representation to problem | |
| 12. |
The_major_component/components_for_measuring_the_performance_of_problem_solving |
| A. | Completeness |
| B. | Optimality |
| C. | Time and Space complexity |
| D. | All of the mentioned |
| Answer» E. | |
| 13. |
The process of removing detail from a given state representation is called_____? |
| A. | Extraction |
| B. | Abstraction |
| C. | Information Retrieval |
| D. | Mining of data |
| Answer» C. Information Retrieval | |
| 14. |
A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. State whether true or false. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 15. |
The Set of actions for a problem in a state space is formulated by a ___________ |
| A. | Intermediate states |
| B. | Initial state |
| C. | Successor function, which takes current action and returns next immediate state |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 16. |
A problem in a search space is defined by one of these state. |
| A. | Initial state |
| B. | Last state |
| C. | Intermediate state |
| D. | All of the above |
| Answer» B. Last state | |
| 17. |
A search algorithm takes _________ as an input and returns ________ as an output. |
| A. | Input, output |
| B. | Problem, solution |
| C. | Solution, problem |
| D. | Parameters, sequence of actions |
| Answer» C. Solution, problem | |
| 18. |
The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. State True or False |
| A. | True |
| B. | False |
| Answer» B. False | |
| 19. |
What is state space? |
| A. | The whole problem |
| B. | Your Definition to a problem |
| C. | Problem you design |
| D. | Representing your problem with variable and parameter |
| Answer» E. | |
| 20. |
The main task of a problem-solving agent is |
| A. | Solve the given problem and reach to goal |
| B. | To find out which sequence of action will get it to the goal state |
| C. | All of the mentioned |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |