NEW
Font size
WorksheetsAI 2
Total questions: 29
Worksheet time: 15mins
search algorithm takes _________ as an input and returns ________ as an output
Input, output
Problem, solution
Solution, problem
Parameters, sequence of actions
A problem in a search space is defined by one of these state.
Initial state
Intermediate state
Last state
All of the mentioned
The Set of actions for a problem in a state space is formulated by a _______
Successor function, which takes current action and returns next immediate state
Intermediate states
Initial state
None of the mentioned
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
True
False
The process of removing detail from a given state representation is called __
Abstraction
Extraction
Information Retrieval
Mining of data
The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.
Travelling Salesman problem(TSP)
Finding shortest path between a source and a destination
Map coloring problem
Depth first search traversal on a given map represented as a graph
Web Crawler is a/an ____________
Problem-solving agent
Simple reflex agent
Intelligent goal-based agent
Model based agent
What is the major component/components for measuring the performance of problem solving?
Time and Space complexity
Completeness
Optimality
All of the mentioned
3. Which search method takes less memory?
Depth-First Search
Linear Search
Optimal search
Breadth-First search
Which is the best way to go for Game playing problem?
Linear approach
An Optimal approach
Heuristic approach (Some knowledge is stored)
Random approach
Which search strategy is also called as blind search?
Simple reflex search
Uninformed search
Informed search
All of the mentioned
How many types are available in uninformed search method?
2
3
5
6
Which search is implemented with an empty first-in-first-out queue?
Depth-first search
Bidirectional search
Breadth-first search
None of the mentioned
When is breadth-first search is optimal?
When all step costs are unequal
When all step costs are equal
When there is less number of nodes
None of the mentioned
What is the space complexity of Depth-first search?
O(b)
O(bm)
O(bl)
O(m)
Depth-first search always expands the ______ node in the current fringe of the search tree.
Minimum cost
Shallowest
Child node
Deepest
Breadth-first search always expands the ______ node in the current fringe of the search tree.
Shallowest
Deepest
Child node
Minimum cost
What is the other name of informed search strategy?
Simple search
Online search
Heuristic search
None of the mentioned
How many types of informed search method are in artificial intelligence?
1
5
7
4
Which search uses the problem specific knowledge beyond the definition of the problem?
Informed search
Breadth-first search
Depth-first search
Uninformed search
Which function will select the lowest expansion node at first for evaluation?
Depth-first search
Greedy best-first search
Best-first search
None of the mentioned
Which search uses only the linear space for searching?
Best-first search
Depth-first search
Recursive best-first search
None of the mentioned
Which method is used to search better by learning?
Metalevel state space
Depth-first search
Best-first search
None of the mentioned
Which search is complete and optimal when h(n) is consistent?
Depth-first search
Best-first search
A* search
Both Best-first & Depth-first search
Which is used to improve the performance of heuristic search?
Simple form of nodes
quality of nodes
Quality of heuristic function
None of the mentioned
Which function is used to calculate the feasibility of whole game tree?
Alpha-beta pruning
Transposition
Evaluation function
All of the mentioned
What is called as transposition table?
Next value in the search
Hash table of previously seen position
Hash table of next seen positions
None of the mentioned
How the effectiveness of the alpha-beta pruning gets increased?
Depends on the order in which they are executed
Depends on the nodes
All of the mentioned
None of the mentioned
Where does the values of alpha-beta search get updated?
Along the path of search
Initial state itself
At the end
None of the mentioned
