1. What is the goal of Artificial Intelligence?

a) To solve artificial problems

b) To extract scientific causes
c) To explain various sorts of intelligence
d) To solve real-world problems
Ans:d
2. Example of AI System Worked like
a) Google Assistant
b) Manger Assistant
c) Role manger
d) Unknown
3. Turing Test Proposed by
a) Jhon
b) Steve jobs
c) Alan Turing
d) No one
4. Weak AI means
a) to perform week task
b) to perform dedicated Task
c) to perform strong task
d) to perform nothing
5. Strong AI means
a) that simulates human mind
b) that simulates computer mind
c) that simulates hardware mind
d) that simulates Nothing
6. Super AI means
a) man to man Communication
b) machine to machine Communication
c) no Communication
d) none
7. Goal based Agent is
a) to perform as initial state
b) to perform as goal state
c) to perform as false state
d) to perform as none state
8. utility based Agent is
a) to advice the goal state
b) to learn nothing
c) to read things
d) none
9. What is the role of an agent in Artificial Intelligence?
a) It makes decisions based on environmental inputs and acts accordingly
b) It stores large amounts of data
c) It is responsible for hardware operations
d) It only performs mathematical calculations
b. Answer: a) It makes decisions based on environmental inputs and acts accordingly

10.Which search algorithm is considered optimal and complete in a tree

search?

a) Depth-First Search
b) Breadth-First Search
c) A* Search
d) Hill Climbing

Answer: b) Breadth-First Search

11.Which of these is a characteristic of the Turing Test?

a) A test for verifying the speed of a machine's processing

b) A method to measure a machine's ability to imitate human behavior
c) A test to ensure that machines are safe for human use
d) A test for machine learning algorithms

Answer: b) A method to measure a machine's ability to imitate human behavior

12.In AI, what does the term 'heuristic' refer to?

a) A method used to create large datasets

b) A strategy used to find approximate solutions to problems
c) A mathematical function used in optimization
d) A programming language used in AI

Answer: b) A strategy used to find approximate solutions to problems

13.Which of the following search algorithms is used to find the shortest path
in a graph?

a) Depth-First Search (DFS)

b) Breadth-First Search (BFS)
 c) A* Search
d) Hill climbing

Answer: c) A* Search

14.Which of the following methods is used for solving constraint satisfaction

problems?

a) Genetic algorithms
b) Backtracking
c) A* search
d) Simulated Annealing

Answer: b) Backtracking

15. Time Complexity means

a) Measure of price
b) Measure of Time
c) Measure of Memory
d) Measure of field
16. Space complexity means
a) Minimum storage requirement
b) Maximum storage requirement
c) process storage requirement
d) none
17. Breadth first Search Algorithm implements
a) LAST IN FIRST OUT
b) FIRST IN FIRST OUT
c) INPUT
d) OUTPUT
18. Depth first Search Algorithm implements
a) LAST IN FIRST OUT
b) FIRST IN FIRST OUT
c) INPUT
d) OUTPUT
19. Uniform Cost Search Algorithm implements
a) Queue
b) Priority Queue
c) INPUT
d) OUTPUT
20. Best First Search Algorithm implements
a) Queue
b) Priority Queue
 c) INPUT
d) OUTPUT
21. Hill Climbing is also Known as
a) Super Search
b) Greedy Local Search
c) Minimum Search
d) Maximum Search
22. AO* Search Algorithm performs Problems into
a) Smaller Pieces
b) Larger Pieces
c) Tiny Pieces
d) None
23. AO* Search Algorithm performs formula as
a) F(n)=G(n)+H(n)
b) F(n)=G(n)-H(n)
c) F(n)=G(n)/H(n)
d) F(n)=G(n)*H(n)
24. What is the main feature of the Uniform Cost Search (UCS) algorithm?
A) It explores the search space randomly.
B) It expands the node with the least path cost.
C) It explores the search space in a depth-first manner.
D) It expands nodes based on the heuristic value.

Answer: B) It expands the node with the least path cost.

25. In Uniform Cost Search, the path cost is determined by the __________.
E) Depth of the node
F) Heuristic function
G) Sum of the edge costs from the start to the node
H) Number of actions performed

Answer: C) Sum of the edge costs from the start to the node

26. Who is considered the "father" of Artificial Intelligence?

I) John McCarthy
J) Alan Turing
K) Marvin Minsky
L) Claude Shannon

Answer: A) John McCarthy

27. Which year is considered the birth of Artificial Intelligence, marked by the famous Dartmouth
Conference?
M) 1945
N) 1950
O) 1956
P) 1965

Answer: C) 1956

28. Who coined the term "Artificial Intelligence"?

Q) Alan Turing
R) John McCarthy
S) Arthur Samuel
T) Norbert Wiener

Answer: B) John McCarthy

29. An agent that is able to perceive its environment through sensors and take actions based on its
perceptions is called a __________.
U) Reactive agent
V) Autonomous agent
W) Reflex agent
X) Rational agent

Answer: B) Autonomous agent

30. Which type of agent performs actions based on a set of predefined rules and does not change its
behavior based on experience or learning?
Y) Learning agent
Z) Reflex agent
AA) Rational agent
BB) Autonomous agent

Answer: B) Reflex agent

1. The __________ is a test for evaluating whether a machine's behavior can
be indistinguishable from that of a human.

Answer: Turing Test

2. A __________ is a set of rules that uses logic to simulate human expertise in specific areas, often
used in expert systems.
Answer: Knowledge Base
3. Actuators like_____________________________________
4. Sensors are ___________________________________________
5. An Agent in Artificial Intelligence is_______________________
6. Time Complexity of Breadth First Search____________
7. Time Complexity of Depth First Search____________
8. Time Complexity of Best First Search____________
9. n game playing, the __________ is the set of all possible positions or configurations that can be
achieved in the game.
Answer: State Space

10. The __________ algorithm is a popular decision-making algorithm used in two-player games
that finds the best move by exploring the entire game tree.
Answer: Minimax

11. In the Minimax algorithm, the __________ value is used to represent the optimal move for the
maximizing player (e.g., the player who aims to maximize their score).
Answer: Max

12.The __________ is a technique used to optimize the Minimax algorithm by

pruning branches of the game tree that cannot influence the final decision.

Answer: Alpha-Beta Pruning

13. Alpha-Beta Pruning is an optimization technique for the __________ algorithm, which
helps to reduce the number of nodes evaluated in the search tree.

Answer: Minimax
14. In Alpha-Beta Pruning, the __________ value represents the best value that the
maximizing player can guarantee so far.

Answer: Alpha

15. In Alpha-Beta Pruning, the __________ value represents the best value that the
minimizing player can guarantee so far.

Answer: Beta

16. In Alpha-Beta Pruning, when the current node's value is greater than or equal to the beta
value, the current node is __________ and no further exploration is done on that branch.

Answer: Pruned

17. The Alpha-Beta Pruning technique is particularly useful in __________ games, where
there is a two-player competitive environment and the game tree can grow very large.

Answer: Two-player, Zero-Sum

18. When performing Alpha-Beta Pruning, the order in which moves are evaluated can
impact the __________ of pruning that can occur.

Answer: Amount

19. In the context of CSP, a __________ is a set of constraints that must be satisfied by the
solution.

Answer: Constraint

20. The process of __________ is used to find a solution to a CSP by testing possible
assignments for variables and removing assignments that violate constraints.

Answer: Backtracking
21. In a CSP, a variable is said to be __________ when it is assigned a value that violates one
or more constraints.

Answer: Inconsistent

22. A __________ is a situation where the current solution cannot be improved by any
neighboring solution, even though it may not be a global optimum.

Answer: Local Optimum

23. The algorithm that moves from one solution to a neighboring solution and accepts a move
even if it results in a worse solution is called __________.

Answer: Hill Climbing

24. In the Wumpus World, the agent's goal is to find the __________ and avoid the Wumpus,
which is dangerous.

Answer: Gold

25. The Wumpus World is an example of a __________ search problem, where the agent
must plan a series of actions to achieve a specific goal.

Answer: State-Space

26. Hill Climbing is an __________ search algorithm that continuously moves towards the
direction of increasing value to find the peak or solution.

Answer: Incremental

27. In Hill Climbing, the algorithm moves from the current state to the __________ state in
the search space that improves the evaluation function.

Answer: Neighboring
28. In the context of Hill Climbing, a __________ occurs when there is no neighboring state
that improves the current state’s evaluation function.

Answer: Plateau

29. To avoid getting stuck in local optima, an enhancement called __________ Hill Climbing
introduces random jumps to escape from suboptimal solutions.

Answer: Stochastic

30. Hill Climbing is considered a simple search algorithm because it doesn't require
__________, but it often sacrifices finding a global optimum.

Answer: Backtracking