This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Problem Solving”.
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
Explanation: The problem-solving agents are one of the goal-based agents.
2. 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
Explanation: Because state space is mostly concerned with a problem, when you try to solve a problem, we have to design a mathematical structure to the problem, which can only be through variables and parameters. eg. You have given a 4-gallon jug and another 3-gallon jug. Neither has measuring marker on it. You have to fill the jugs with water. How can you get exactly 2 gallons of water in to 4 gallons. Here the state space can defined as set of ordered pairs integers(x,y),such that x=0,1,2,3 or 4 and y=0,1,2 or 3;X represents the number of gallons in 4 gallon jug and y represents quantity of water in the 3-gallon jug.
3.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
Explanation: Refer to the definition of problem-solving agent.
4. 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
Explanation: A search algorithm takes input as a problem and returns a solution to the problem as an output.
5. 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
Explanation: A problem has four components initial state, goal test, set of actions, path cost.
a) Intermediate states
b) Initial state
c) Successor function, which takes current action and returns next immediate state
d) None of the mentioned
Explanation: The most common formulation for actions uses a successor function. Given a particular state x, SUCCESSOR-FN(x) returns a set of (action, successor) ordered pairs, where each action is one of the legal actions in state x and each successor is a state that can be reached from x by applying the action.
7. 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.
Explanation: 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 lowest path cost among all solutions.
8. The process of removing detail from a given state representation is called______
c) Information Retrieval
d) Mining of data
Explanation: The process of removing detail from a representation is called abstraction.
9. 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)
Explanation: Problem-solving approach works well for toy problems and real-world problems.
10. 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
Explanation: Refer the TSP problem.
11. Web Crawler is a/an
a) Intelligent goal-based agent
b) Problem-solving agent
c) Simple reflex agent
d) Model based agent
Explanation: Web Crawling is type of search for a relevant document from a given seed documents. Focused crawlers exists, helps to improvise the search efficiency.
c) Time and Space complexity
d) All of the mentioned
Explanation: For best performance consideration of all component is necessary.
13. 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
Explanation: When you are trying to solve a problem, you should design how to get a step-by-step solution with constraints condition to your problem, e.g Chess board problem.
14. Which search method takes less memory?
a) Depth-First Search
b) Breadth-First search
c) Linear Search
d) Optimal search
Explanation: Depth-First Search takes less memory since only the nodes on the current path are stored, but in Breadth First Search, all of the tree that has generated must be stored.
15. 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
Explanation: We use a Heuristic approach, as it will find out brute force computation, looking at hundreds of thousands of positions. e.g Chess competition between Human and AI based Computer.
Sanfoundry Global Education & Learning Series – Artificial Intelligence.