1
What is Artificial Intelligence (AI)?
Correct Answer
A field focused on creating machines that can perform tasks requiring human intelligence
☑ MCQ PRACTICE
Artificial Intelligence Unit 1
Practice objective questions for quick revision and examination preparation. Try answering each question before revealing the answer.
Artificial Intelligence - Search Strategies
2
An intelligent agent is:
Correct Answer
A system that perceives its environment and takes actions to achieve goals
3
Problem-solving agents are designed to:
Correct Answer
Solve specific problems by searching for solutions
4
Which of the following is an uninformed search strategy?
Correct Answer
Breadth-first search
5
Breadth-first search (BFS) explores:
Correct Answer
The shallowest node first
6
Uniform cost search (UCS) is optimal when:
Correct Answer
All step costs are non-negative
7
Depth-first search (DFS) explores:
Correct Answer
The deepest node first
8
Iterative deepening depth-first search (IDDFS) combines:
Correct Answer
BFS and DFS
9
Bidirectional search is efficient when:
Correct Answer
The goal state is known
10
Greedy best-first search uses:
Correct Answer
A heuristic to estimate the cost to the goal
11
A* search is optimal if the heuristic is:
Correct Answer
Consistent and admissible
12
A heuristic function is:
Correct Answer
A function that estimates the cost to the goal
13
Hill-climbing search is a type of:
Correct Answer
Local search
14
Simulated annealing search is inspired by:
Correct Answer
The process of heating and cooling metals
15
Local search in continuous spaces deals with:
Correct Answer
Continuous variables
16
Which search strategy is complete but not optimal?
Correct Answer
Depth-first search
17
Which search strategy uses a priority queue based on path cost?
Correct Answer
Uniform cost search
18
Which search strategy is prone to getting stuck in local maxima?
Correct Answer
Hill-climbing search
19
Which search strategy is guaranteed to find the shortest path in a graph?
Correct Answer
Breadth-first search
20
Which search strategy is both complete and optimal?
Correct Answer
A* search
21
Which of the following is NOT an uninformed search strategy?
Correct Answer
Greedy best-first search
22
Which search strategy uses a stack for node exploration?
Correct Answer
Depth-first search
23
Which search strategy uses a queue for node exploration?
Correct Answer
Breadth-first search
24
Which search strategy is most likely to get stuck in an infinite loop?
Correct Answer
Depth-first search
25
Which search strategy is best suited for large search spaces with a known goal state?
Correct Answer
Bidirectional search
26
Which search strategy is inspired by the natural process of metal cooling?
Correct Answer
Simulated annealing search
27
Which search strategy is NOT guaranteed to find a solution?
Correct Answer
Hill-climbing search
28
Which search strategy uses a heuristic to prioritize nodes?
Correct Answer
Greedy best-first search
29
Which search strategy is used to solve optimization problems?
Correct Answer
Hill-climbing search
30
Which search strategy is both complete and optimal for graphs with non-negative edge costs?
Correct Answer
A* search
Fill in the Blanks
31
Artificial Intelligence (AI) is the field of creating machines that can perform tasks requiring __________ intelligence.
Correct Answer
human
32
An intelligent agent perceives its environment through __________ and takes actions to achieve its goals.
Correct Answer
sensors
33
Problem-solving agents use __________ to find solutions to specific problems.
Correct Answer
search algorithms
34
Breadth-first search (BFS) explores the __________ nodes first.
Correct Answer
shallowest
35
Depth-first search (DFS) explores the __________ nodes first.
Correct Answer
deepest
36
Uniform cost search (UCS) prioritizes nodes based on __________.
Correct Answer
path cost
37
Iterative deepening depth-first search (IDDFS) combines the benefits of __________ and __________.
Correct Answer
BFS, DFS
38
Bidirectional search performs two simultaneous searches: one from the start node and one from the __________ node.
Correct Answer
goal
39
Greedy best-first search uses a __________ function to estimate the cost to the goal.
Correct Answer
heuristic
40
A* search is optimal if the heuristic is __________ and __________.
Correct Answer
admissible, consistent
41
A heuristic function provides an __________ of the cost to reach the goal.
Correct Answer
estimate
42
Hill-climbing search is a __________ search algorithm that moves toward the highest-valued neighbor.
Correct Answer
local
43
Simulated annealing search is inspired by the process of __________ and __________ metals.
Correct Answer
heating, cooling
44
Local search in continuous spaces deals with __________ variables.
Correct Answer
continuous
45
Breadth-first search is __________ but not always __________.
Correct Answer
complete, optimal
46
Depth-first search is not guaranteed to find the __________ path.
Correct Answer
shortest
47
Uniform cost search is optimal for graphs with __________ edge costs.
Correct Answer
non-negative
48
A* search uses the formula __________ to evaluate nodes.
Correct Answer
f(n) = g(n) + h(n)
49
Hill-climbing search can get stuck in __________ maxima.
Correct Answer
local
50
Simulated annealing search allows __________ moves to escape local optima.
Correct Answer
random
51
Bidirectional search reduces the __________ of the search space.
Correct Answer
size
52
Greedy best-first search is not __________ because it does not consider the total path cost.
Correct Answer
optimal
53
A heuristic function is __________ if it never overestimates the cost to the goal.
Correct Answer
admissible
54
Depth-first search uses a __________ data structure for node exploration.
Correct Answer
stack
55
Breadth-first search uses a __________ data structure for node exploration.
Correct Answer
queue
56
Iterative deepening depth-first search is a combination of __________ and __________.
Correct Answer
BFS, DFS
57
Local search algorithms are useful for solving __________ problems.
Correct Answer
optimization
58
Simulated annealing search is a __________ search algorithm.
Correct Answer
probabilistic
59
A* search is both __________ and __________ if the heuristic is admissible and consistent.
Correct Answer
complete, optimal
60
In continuous spaces, local search algorithms deal with __________ variables instead of discrete states.
Correct Answer
continuous