Search Algorithms Quiz
Authored by vijaya suresh
Engineering
University
Used 3+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
25 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
1 min • 4 pts
In which search strategy is the shallowest node expanded first?
Depth First Search
Breadth First Search
Hill Climbing
A* Search
2.
MULTIPLE CHOICE QUESTION
1 min • 4 pts
Which of the following is NOT an example of uninformed search?
Breadth First Search
Depth First Search
Hill Climbing
Uniform Cost Search
3.
MULTIPLE CHOICE QUESTION
1 min • 4 pts
Which of these search algorithms uses a heuristic function to guide the search?
Breadth First Search
Depth First Search
Hill Climbing
Depth Limited Search
4.
MULTIPLE CHOICE QUESTION
1 min • 4 pts
The A* algorithm uses which two components to evaluate nodes?
Cost and depth
Path cost and heuristic cost
Breadth and depth
Step cost only
5.
MULTIPLE CHOICE QUESTION
1 min • 4 pts
What is the primary disadvantage of depth first search?
May find sub-optimal solution
High space requirement
Needs heuristic function
Cannot be used in trees
6.
MULTIPLE CHOICE QUESTION
1 min • 4 pts
Which search algorithm is guaranteed to find the optimal solution if the heuristic is admissible?
Hill Climbing
A* Search
Depth First Search
Breadth First Search
7.
MULTIPLE CHOICE QUESTION
1 min • 4 pts
What is the main challenge in heuristic search?
Using too little memory
Defining a suitable heuristic
Infinite loops
Large step costs
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
