WorksheetsQuiz on Informed and Uninformed Algorithms-AI-17.02.2025
Total questions: 20
Worksheet time: 10mins
Name
Class
Date
1.
Reg.No (Ex. RA2311027010076)
4 lines
2.
Full Name
4 lines
3.
Section
4 lines
4.
Mail-Id
4 lines
5.
Which of the following is an uninformed search algorithm?
a)
A* Search
b)
Greedy Best-First Search
c)
Breadth-First Search (BFS)
d)
Iterative Deepening A* (IDA*)
6.
Which search algorithm guarantees the shortest path in an unweighted graph?
a)
Depth-First Search (DFS)
b)
Breadth-First Search (BFS)
c)
A* Search
d)
Uniform Cost Search (UCS)
7.
Which of the following is a feature of Depth-First Search (DFS)?
a)
It is guaranteed to find the optimal solution.
b)
It explores all nodes at the current depth level before moving to the next.
c)
It explores a node as far as possible before backtracking.
d)
It uses a heuristic function to guide the search.
8.
Which of the following algorithms uses a heuristic function to guide the search toward the goal?
a)
Uniform Cost Search (UCS)
b)
Depth-First Search (DFS)
c)
A* Search
d)
Breadth-First Search (BFS)
9.
In the A* search algorithm, which function is used to determine the next node to explore?
a)
g(n)
b)
f(n) = g(n) + h(n)
c)
h(n)
d)
f(n) = g(n) - h(n)
10.
Which of the following is a disadvantage of using Depth-First Search (DFS)?
a)
It can get stuck in infinite loops in cyclic graphs.
b)
It cannot find the optimal solution.
c)
It requires a large amount of memory.
d)
It is guaranteed to find the shortest path in weighted graphs.
11.
Which search algorithm combines the depth-first nature of DFS with the completeness of BFS?
a)
Depth-Limited Search (DLS)
b)
Uniform Cost Search (UCS)
c)
Iterative Deepening Depth-First Search (IDDFS)
d)
Greedy Best-First Search
12.
Which of the following algorithms is not an informed search algorithm?
a)
A* Search
b)
Greedy Best-First Search
c)
Uniform Cost Search (UCS)
d)
Beam Search
13.
What is the primary characteristic of an uninformed search algorithm?
a)
Uses a heuristic function to find the goal efficiently.
b)
Makes decisions based on the estimated cost to reach the goal.
c)
Does not use any domain-specific knowledge or heuristic to guide the search.
d)
Expands nodes based on the lowest path cost.
14.
Which of the following algorithms is not guaranteed to find the optimal solution?
a)
A* Search
b)
Greedy Best-First Search
c)
Uniform Cost Search (UCS)
d)
Breadth-First Search (BFS)
15.
What is a key advantage of using an informed search algorithm over an uninformed search algorithm?
a)
It is always guaranteed to find the optimal solution.
b)
It requires less memory than uninformed algorithms.
c)
It uses domain-specific knowledge (heuristics) to explore more promising paths.
d)
It always performs better in terms of time complexity than uninformed search.
16.
Which of the following algorithms expands the node with the lowest path cost in a weighted graph?
a)
A* Search
b)
Greedy Best-First Search
c)
Uniform Cost Search (UCS)
d)
Depth-First Search (DFS)
17.
In the context of heuristic search, what does the term "admissible heuristic" refer to?
a)
A heuristic that always leads to the optimal solution.
b)
A heuristic that can never overestimate the cost to reach the goal.
c)
A heuristic that requires less memory to store.
d)
A heuristic that estimates the cost to reach the goal based on exploration.
18.
Which search algorithm can be used for both unweighted and weighted graphs and guarantees the optimal path if the edge costs are non-negative?
a)
A* Search
b)
Depth-First Search (DFS)
c)
Uniform Cost Search (UCS)
d)
Greedy Best-First Search
19.
What is the main advantage of Depth-Limited Search (DLS) over Depth-First Search (DFS)?
a)
It guarantees finding the optimal solution.
b)
It prevents infinite loops in cyclic graphs by limiting the search depth.
c)
It explores the search space more efficiently than DFS.
d)
It guarantees the shortest path in weighted graphs.
20.
In the A* search algorithm, which function is used to determine the next node to explore?
a)
g(n)
b)
f(n) = g(n) + h(n)
c)
h(n)
d)
f(n) = g(n) - h(n)
100 %
