Font size
WorksheetsSearch Algorithms
Total questions: 18
Worksheet time: 10mins
Searching is a Sequence of Steps that transforms the _______________ to the _______________.
Initial State , Goal State
Goal State , Initial State
Start State, Initial State
Goal State, Start State
Un-informed Search Examples are
Breadth First Search
Depth First Search
Bidirectional search
All of these
Which of the following search algorithm requires less memory?
Depth First Search
Optimal Search
Breadth-First Search
Linear Search
A heuristic is a way
To discover something or an idea embedded in a program
To compare two nodes in a search tree to see if one is better than other
To search and measure how far a node in a search tree seems to be from goal
All Above
Dijkstra’s algorithm / Uniform-cost search expands the node n with the ......
Heuristic cost
Lowest path cost
Highest path cost
Average path cost
A* evaluates nodes by combining g(n), the cost to reach the node, and f(n), the cost to get from the node to the goal.
TRUE
FALSE
Which of the followings have no additional information about the states
Uninformed search
Informed search
All
None
Which one of the following searches is optimal
DFS (Depth-first search)
Depth Limited Search
BFS (Breadth-first search)
Uninformed search
Which one has been provided with a predefined depth limit.
BFS (Breadth-first search)
DFS (Depth-first search)
DLS (Depth-limited Search)
IDS (Iterative Deepening Search)
When is breadth-first search is optimal?
When there is less number of nodes
When all step costs are equal
When all step costs are unequal
None of the mentioned
Which of the following is/are Uninformed Search technique/techniques?
Breadth First Search (BFS)
Depth First Search (DFS)
Bidirectional Search
All of the mentioned
What is the other name of informed search strategy?
Simple search
Heuristic search
Online search
None of the mentioned
Which search uses the problem specific knowledge beyond the definition of the problem?
Informed search
Depth-first search
Breadth-first search
Uninformed search
A* algorithm is based on ___________
Breadth-First-Search
Depth-First –Search
Best-First-Search
Hill climbing
