1. What is the main task of a problem-solving agent?

​
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. Both A and B​
D. None of the Above
View Answer
Ans : C​

Explanation: The problem-solving agents are one of the goal-based agents.

2. What is Initial state + Goal state in Search Terminology?​

A. Problem Space​
B. Problem Instance​
C. Problem Space Graph​
D. Admissibility
View Answer
Ans : B​

Explanation: Problem Instance : It is Initial state + Goal state.

3. What is Time Complexity of Breadth First search algorithm?​

A. b​
B. b^d​
C. b^2​
D. b^b
View Answer
Ans : B​

Explanation: Time Complexity of Breadth First search algorithm is b^d.

4. Depth-First Search is implemented in recursion with _______ data structure.​

A. LIFO​
B. LILO​
C. FIFO​
D. FILO
View Answer
Ans : A​

Explanation: Depth-First Search implemented in recursion with LIFO stack data structure.

5. How many types are available in uninformed search method?​

A. 2​
B. 3​
 C. 4​
D. 5
View Answer
Ans : D​

Explanation: The five types of uninformed search method are Breadth-first, Uniform-cost, Depth-first,
Depth-limited and Bidirectional search.

6. Which data structure conveniently used to implement BFS?​

A. Stacks​
B. Queues​
C. Priority Queues​
D. None of the Above
View Answer
Ans : B​

Explanation: Queue is the most convenient data structure, but memory used to store nodes can be
reduced by using circular queues.

7. How many types of informed search method are in artificial intelligence?​

A. 2​
B. 3​
C. 4​
D. 5
View Answer
Ans : C​

Explanation: The four types of informed search method are best-first search, Greedy best-first search,
A* search and memory bounded heuristic search.

8. 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
View Answer
Ans : C​

Explanation: Sometimes minimum heuristics can be used, sometimes maximum heuristics function
can be used. It depends upon the application on which the algorithm is applied.

9. What is disadvantage of Greedy Best First Search?​

A. This algorithm is neither complete, nor optimal.​
B. It can get stuck in loops. It is not optimal.​
 C. There can be multiple long paths with the cost ≤ C*​
D. may not terminate and go on infinitely on one path
View Answer
Ans : B​

Explanation: The disadvantage of Greedy Best First Search is that it can get stuck in loops. It is not
optimal.

10. Searching using query on Internet is, use of ___________ type of agent.​
A. Offline agent​
B. Online Agent​
C. Goal Based​
D. Both B and C
View Answer
Ans : D​

Explanation: Refer to the definitions of both the type of agent.

11. What is Branching Factor?​

A. Length of the shortest path from initial state to goal state.​
B. The average number of child nodes in the problem space graph.​
C. A property of an algorithm to always find an optimal solution.​
D. None of the Above
View Answer
Ans : B​

Explanation: Branching Factor : The average number of child nodes in the problem space graph.

12. What is Space Complexity of Depth First search algorithm?​

A. b​
B. b^2​
C. b^b​
D. b^m
View Answer
Ans : D​

Explanation: Space Complexity of Depth First search algorithm is b^m

13. The process of removing detail from a given state representation is called
______​
A. Extraction​
B. Abstraction​
C. Information Retrieval​
D. Mining of data
View Answer
Ans : B​

Explanation: The process of removing detail from a representation is called abstraction.

14. Which of the following search algorithm searches forward from initial state
and backward from goal state till both meet to identify a common state?​
A. Uniform Cost Search​
B. Iterative Deepening Depth-First Search​
C. Bidirectional Search​
D. None of the Above
View Answer
Ans : C​

Explanation: Bidirectional Search searches forward from initial state and backward from goal state till
both meet to identify a common state.

15. When is breadth-first search is optimal?​

A. When there is less number of nodes​
B. When all step costs are equal​
C. When all step costs are unequal​
D. All of the above
View Answer
Ans : B​

Explanation: Because it always expands the shallowest unexpanded node.

16. uniform-cost search expands the node n with the __________​

A. Lowest path cost​
B. Heuristic cost​
C. Highest path cost​
D. Average path cost
View Answer
Ans : A​

Explanation: Uniform-cost search expands the node n with the lowest path cost. Note that if all step
costs are equal, this is identical to breadth-first search.

17. What is the heuristic function of greedy best-first search?​

A. f(n) != h(n)​
B. f(n) < h(n)​
C. f(n) = h(n)​
D. f(n) > h(n)
View Answer
Ans : C​
Explanation: f(n) = h(n) is the heuristic function of greedy best-first searc

18. A* algorithm is based on __________​

A. Breadth-First-Search​
B. Depth-First-Search​
C. Uniform Cost Search​
D. Best-First-Search
View Answer
Ans : D​

Explanation: Best-first-search is giving the idea of optimization and quick choose of path, and all these
characteristic lies in A* algorithm.

19. 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 above
View Answer
Ans : C​

Explanation: When no neighbor is having higher value, algorithm terminates fetching local min/max.

20. Is optimality and completeness exist in bidirectional search algorithm?​

A. Yes, Yes​
B. No, Yes​
C. Yes, No​
D. No, No
View Answer
Ans : A​

Explanation: Yes, optimality and completeness both exist in bidirectional search algorithm

21) Which of the following is the main job of a problem-solving agent?

(A). Solve the given problem and reach the goal
(B). To discover which sequence of the job will get it to the goal state
(C). All of these
(D). None of these
MCQ Answer is: c
22) Which of the following is state space?
(A). Expressing your problem with variable and parameter
(B). Your Definition of a problem
(C). Problem you design
(D). The whole problem
MCQ Answer is: d

23) The problem-solving agent with several immediate options of unknown value can determine
that what to do by just investigating the various possible sequences of actions that lead to states
of known value, and then selecting the best sequence among all. This kind of looking for such a
sequence is commonly called Search.
(A). True
(B). False (C). Partially True
MCQ Answer is: a

A problem in search space is defined by which one of the following states.

(A). Intermediate state
(B). Last state
(C). Initial state

1.​ What is the main task of a problem-solving agent?​

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: c​
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
Answer: d​
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 the 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.​
a) True​
b) False
Answer: a​
Explanation: Refer to the definition of problem-solving agent.

4.​ 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 mentioned
Answer: a​
Explanation: A problem has four components initial state, goal test, set of actions, path cost.

5.​ 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: c​
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.

6.​ 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.​
a) True​
b) False

Answer: a​
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.

7.​ The process of removing detail from a given state representation is called ______​
a) Extraction​
b) Abstraction​
c) Information Retrieval​
d) Mining of data

Answer: b​
Explanation: The process of removing detail from a representation is called abstraction.

8.​ 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: d​
Explanation: Problem-solving approach works well for toy problems and real-world problems.

9.​ What is 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: d​
Explanation: For best performance consideration of all component is necessary.

10.​What is the general term of Blind searching?​

a) Informed Search​
b) Uninformed Search​
c) Informed & Unformed Search​
d) Heuristic Search
Answer: b​
Explanation: In case of uninformed search no additional information except the problem definition is
given.
 11.​Strategies that know whether one non-goal state is “more promising” than another are called
___________​
a) Informed & Unformed Search​
b) Unformed Search​
c) Heuristic & Unformed Search​
d) Informed & Heuristic Search
Answer: d​
Explanation: Strategies that know whether one non-goal state is “more promising”
than another are called informed search or heuristic search strategies.

12.​Which of the following is/are Uninformed Search technique/techniques?​

a) Breadth First Search (BFS)​
b) Depth First Search (DFS)​
c) Bidirectional Search​
d) All of the mentioned
Answer: d​
Explanation: Several uninformed search techniques includes BFS, DFS, Uniform-cost, Depth-limited,
Bidirectional search etc.

13.​The time and space complexity of BFS is (For time and space complexity problems consider b as
branching factor and d as depth of the search tree.)​
a) O(bd+1) and O(bd+1)​
b) O(b2) and O(d2)​
c) O(d2) and O(b2)​
d) O(d2) and O(d2)

Answer: a​
Explanation: We consider a hypothetical state space where every state has b successors. The root of the
search tree generates b nodes at the first level, each of which generates b more nodes, for a total of b2 at the
second level. Each of these generates b more nodes, yielding b3 nodes at the third level, and so on. Now
suppose that the solution is at depth d. In the worst case, we would expand all but the last node at level d
(since the goal itself is not expanded), generating bd+1- b nodes at level d+1.

14.​Breadth-first search is not optimal when all step costs are equal, because it always expands the
shallowest unexpanded node.​
a) True​
b) False

Answer: b​
Explanation: Breadth-first search is optimal when all step costs are equal, because it always expands the
shallowest unexpanded node. If the solution exists in shallowest node no irrelevant nodes are expanded.

15.​uniform-cost search expands the node n with the __________​

a) Lowest path cost​
b) Heuristic cost​
 c) Highest path cost​
d) Average path cost

Answer: a​
Explanation: Uniform-cost search expands the node n with the lowest path cost. Note that if all step costs are
equal, this is identical to breadth-first search.

16.​Depth-first search always expands the ______ node in the current fringe of the search tree.​
a) Shallowest​
b) Child node​
c) Deepest​
d) Minimum cost

Answer: c​
Explanation: Depth-first search always expands the deepest/leaf node in the current fringe of the search tree

17.​Breadth-first search always expands the ______ node in the current fringe of the search tree.​
a) Shallowest​
b) Child node​
c) Deepest​
d) Minimum cost

Answer: a​
Explanation: Breadth-first search always expands the shallowest node in the current fringe of the search tree.
Traversal is performed level wise.

18.​Optimality of BFS is ___________​

a) When there is less number of nodes​
b) When all step costs are equal​
c) When all step costs are unequal​
d) None of the mentioned

Answer: b​
Explanation: It always expands the shallowest unexpanded node.

19.​When the environment of an agent is partially observable in search space following problem/problems
could occur.

a) Sensorless problems: If the agent has no sensors at all, then (as far as it knows) it could be in one
of several possible initial states, and each action might therefore lead to one of several possible
successor states​
b) Contingency problems: If the environment is partially observable or if actions are uncertain, then the
agent’s percepts provide new information after each action. Each possible percept defines a
 contingency that must be planned for. A problem is called adversarial if the uncertainty is caused by
the actions of another agent​
c) Exploration problems: When the states and actions of the environment are unknown, the agent must
act to discover them. Exploration problems can be viewed as an extreme case of contingency
problems​
d) All of the mentioned

Answer: d

20.​For general graph, how one can get rid of repeated states?​
a) By maintaining a list of visited vertices​
b) By maintaining a list of traversed edges​
c) By maintaining a list of non-visited vertices​
d) By maintaining a list of non-traversed edges

Answer: a​
Explanation: Other techniques are costly.

21 . DFS is ______ efficient and BFS is __________ efficient.​

a) Space, Time​
b) Time, Space​
c) Time, Time​
d) Space, Space

Answer: a

21.​The main idea of Bidirectional search is to reduce the time complexity by searching two way
simultaneously from start node and another from goal node.​
a) True​
b) False

Answer: a​
Explanation: The idea behind bidirectional search is to run two simultaneous searches-one forward from the
initial state and the other backward from the goal, stopping when the two searches meet in the middle. The
motivation is that bd/2 + bd/2 is much less than bd.

22.What is the other name of informed search strategy?​

a) Simple search​
b) Heuristic search​
c) Online search​
d) None of the mentioned
Answer: b​
Explanation: A key point of informed search strategy is heuristic function, So it is called as heuristic function.