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
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
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
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
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
The process of removing detail from a given state representation is called
______
a) Extraction
b) Abstraction
c) Information Retrieval
d) Mining of data
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
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
Which search method takes less memory?
a) Depth-First Search
b) Breadth-First search
c) Linear Search
d) Optimal search
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
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 graphWhat 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
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs)
focuses on “Uninformed Search and Exploration”.
1. What is the general term of Blind searching?
a) Informed Search
b) Uninformed Search
c) Informed & Unformed Search
d) Heuristic Search
2. 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
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
Which data structure conveniently used to implement BFS?
a) Stacks
b) Queues
c) Priority Queues
d) All of the mentioned
Which data structure conveniently used to implement DFS?
a) Stacks
b) Queues
c) Priority Queues
d) All of the mentioned
Breadth-first search is not optimal when all step costs are equal, because it
always expands the shallowest unexpanded node.
a) True
b) False
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
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
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
LIFO is ______ where as FIFO is ________
a) Stack, Queue
b) Queue, Stack
c) Priority Queue, Stack
d) Stack. Priority Queue
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
DFS is ______ efficient and BFS is __________ efficient.
a) Space, Time
b) Time, Space
c) Time, Time
d) Space, Space
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
