1. Who is the “father” of artificial intelligence?

a) Fisher Ada
b) John McCarthy
c) Allen Newell
d) Alan Turning

2. The conference that launched the AI revolution in 1956 was held at?

a) Dartmouth
b) Harvard
c) New York
d) Stanford
3. The performance of an agent can be improved by __________

a) Learning
b) Observing
c) Perceiving
d) None of the mentioned
4. The action of the Simple reflex agent completely depends upon __________

a) Perception history
b) Current perception
c) Learning theory
d) Utility functions
5. Which instruments are used for perceiving and acting upon the environment?

a) Sensors and Actuators

b) Sensors
c) Perceiver
d) None of the mentioned
6. What is meant by agent’s percept sequence?

a) Used to perceive the environment

b) Complete history of actuator
c) Complete history of perceived things
d) None of the mentioned
7. How many types of agents are there in artificial intelligence?

a) 1
b) 2
c) 3
d) 4

Explanation: The four types of agents are Simple reflex, Model based, Goal based and Utility
based agents.
8. What is the rule of simple reflex agent?
 a) Simple-action rule
b) Condition-action rule
c) Simple & Condition-action rule
d) None of the mentioned

Explanation: Simple reflex agent is based on the present condition and so it is

condition action rule.
9. Which is used to improve the agents performance?
a) Perceiving
b) Learning
c) Observing
d) None of the mentioned
10. Which action sequences are used to achieve the agent’s goal?
a) Search
b) Plan
c) Retrieve
d) Both Search & Plan

11. When do we call the states are safely explorable?

a) A goal state is unreachable from any state

b) A goal state is denied access
c) A goal state is reachable from every state
d) None of the mentioned
12. Which of the following algorithm is online search algorithm?

a) Breadth-first search algorithm

b) Depth-first search algorithm
c) Hill-climbing search algorithm
d) None of the mentioned
13. What kind of observing environments are present in artificial intelligence?

a) Partial
b) Fully
c) Learning
d) Both Partial & Fully

14. What is state space?

a) The whole problem
b) Your Definition to a problem
c) Problem you design
d) Representing your problem with variable and parameter
15. A search algorithm takes _________ as an input and returns ________ as an output.
a) Input, output
b) Problem, solution
 c) Solution, problem
d) Parameters, sequence of actions

16. A problem in a search space is defined by one of these state.

a) Initial state
b) Last state
c) Intermediate state
d) All of the mentioned

17. The Set of actions for a problem in a state space is formulated by a ___________
a) Intermediate states
b) Initial state
c) Successor function, which takes current action and returns next immediate state
d) None of the mentioned

18. The Set of actions for a problem in a state space is formulated by a ___________
a) Intermediate states
b) Initial state
c) Successor function, which takes current action and returns next immediate state
d) None of the mentioned
19. What is the major component/components for measuring the performance of problem solving?
a) Completeness
b) Optimality
c) Time and Space complexity
d) All of the mentioned
20. Which search method takes less memory?
a) Depth-First Search
b) Breadth-First search
c) Linear Search
d) Optimal search
21. How many successors are generated in backtracking search?
a) 1
b) 2
c) 3
d) 4

22. What is the space complexity of Depth-first search?

a) O(b)
b) O(bl)
c) O(m)
d) O(bm)

23. When is breadth-first search is optimal?

a) When there is less number of nodes
b) When all step costs are equal
c) When all step costs are unequal
d) None of the mentioned
Answer: b
Explanation: Because it always expands the shallowest unexpanded node.

24. 7. How many parts does a problem consists of?

a) 1
b) 2
c) 3
d) 4

Explanation: The four parts of the problem are initial state, set of actions, goal test and
path cost.
25. Which of the following is/are Uninformed Search technique/techniques?
a) Breadth First Search (BFS)
b) Depth First Search (DFS)
c) Bidirectional Search
d) All of the mentioned
26. Breadth-first search is not optimal when all step costs are equal, because it always
expands the shallowest unexpanded node.
a) True
b) False

Explanation: Breadth-first search is optimal when all step costs are equal, because it
always expands the shallowest unexpanded node. If the solution exists in shallowest
node no irrelevant nodes are expanded.
27. uniform-cost search expands the node n with the __________
a) Lowest path cost
b) Heuristic cost
c) Highest path cost
d) Average path cost
Explanation: Uniform-cost search expands the node n with the lowest path cost. Note that if all step
costs are equal, this is identical to breadth-first search.

28. Depth-first search always expands the ______ node in the current fringe of the search
tree.
a) Shallowest
b) Child node
c) Deepest
d) Minimum cost
29. Breadth-first search always expands the ______ node in the current fringe of the
search tree.
a) Shallowest
b) Child node
c) Deepest
d) Minimum cost
30. DFS is ______ efficient and BFS is __________ efficient.
a) Space, Time
b) Time, Space
c) Time, Time
d) Space, Space
31. What is the other name of informed search strategy?
a) Simple search
b) Heuristic search
c) Online search
d) None of the mentioned
32. Which search is complete and optimal when h(n) is consistent?
a) Best-first search
b) Depth-first search
c) Both Best-first & Depth-first search
d) A* search
33. Which is used to improve the performance of heuristic search?
a) Quality of nodes
b) Quality of heuristic function
c) Simple form of nodes
d) None of the mentioned

Explanation: Good heuristic can be constructed by relaxing the problem, So the

performance of heuristic search can be improved.

34. Which search method will expand the node that is closest to the goal?
a) Best-first search
b) Greedy best-first search
c) A* search
d) None of the mentioned

Explanation: Because of using greedy best-first search, It will quickly lead to the solution
of the problem
35. A* algorithm is based on ___________
a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing

Explanation: Best-first-search is giving the idea of optimization and quick choose of path,
and all these characteristic lies in A* algorithm.

36. Heuristic function h(n) is ________

a) Lowest path cost
b) Cheapest path from root to goal node
 c) Estimated cost of cheapest path from root to goal node
d) Average path cost
37. What is the space complexity of Greedy search?
a) O(b)
b) O(bl)
c) O(m)
d) O(bm)
Explanation: O(bm) is the space complexity where b is the branching factor and m is
the maximum depth of the search tree. Since this algorithm resembles the DFS.
38. A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never
underestimates the cost to reach the goal.
a) True
b) False

Explanation: A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n)

never overestimates the cost to reach the goal. Refer both the example from the book
for better understanding of the algorithms.
39. _________________ are mathematical problems defined as a set of objects whose
state must satisfy a number of constraints or limitations.
a) Constraints Satisfaction Problems
b) Uninformed Search Problems
c) Local Search Problems
d) All of the mentioned
40. Which of the Following problems can be modeled as CSP?
a) 8-Puzzle problem
b) 8-Queen problem
c) Map coloring problem
d) All of the mentioned
41. What among the following constitutes to the incremental formulation of CSP?
a) Path cost
b) Goal cost
c) Successor function
d) All of the mentioned

Explanation: Initial state: The empty assignment ( ), in which all variables are
unassigned.
Successor function: A value can be assigned to any unassigned variable, provided it
does not conflict with previously assigned variables.
Goal test: The current assignment is complete.
Path cost: A constant cost (e.g., 1) for every step.

42. Consider a problem of preparing a schedule for a class of student. What type of
problem is this?
a) Search Problem
 b) Backtrack Problem
c) CSP
d) Planning Problem
Explanation: Schedule developer needs to consider all constraints on teacher as well
as students.

43. The correct ways to solve a problem of state-space search are?

Forward from the initial state
Backward from the goal
Both A and B
None of the above

44. Out of the given options, which of the following algorithms uses the least memory?
DFS
BFS
Both A and B are the same
Cannot be compared
Choose the correct answer from the options given below:
1. A - II, B - IV, C - I, D - III
2. A - II, B - III, C - I, D - IV
3. A - III, B - II, C - IV, D - I
4. A - III, B - IV, C - II, D - I
Option 1 : A - II, B - IV, C - I, D - III

45. Which of the following statements are true?

(A) Minimax search is breadth-first: it processes all the nodes at a level before
moving to a node in next level.

(B) The effectiveness of the alpha-beta pruning is highly dependent on the order
in which the states are examined.

(C) The alpha-beta search algorithm computes the same optimal moves as
minimax algorithm.

(D) Optimal play in games of imperfact information does not require reasoning
about the current and future belief states of each player.

Choose the correct answer from the options given below:

1. (A), (C) only

2. (A) and (D) only
3. (B) and (C) only
4. (C) and (D) only

46. In Artificial Intelligence (AI), a simple reflex agent selects actions on the
basis of.

1. current percept, completely ignoring rest of the percept history.

2. rest of the percept history, completely ignoring current percept.
3. both current percept and complete percept history.
4. both current percept and just previous percept.
Consider the following terminology and match List 1 and List 2 and choose the correct
answer from the code given below
b = branch factor
d = depth of shallowest solution
M = Maximum depth of the search tree
I = depth limit
List 1 List 2
a) BFS i) O(bd)
b) DFS ii) O(bd)
c) Depth – Limited Search iii) O(bm)
d) Iterative deepening Search iv) O(bl)
1. a-iii, b-ii, c-iv, d-i
2. a-ii, b-iii, c-iv, d-i
3. a-i, b-ii, c-iv, d-iii
4. a-i, b-iii, c-iv, d-ii
Option 2 : a-ii, b-iii, c-iv, d-i

47. __________ refers to the ability to perceive or infer information, and to retain it as
knowledge to be applied toward adaptive behaviors within an environment or
context.
Behavior
Nature
Habits
Intelligence

48. When a machine possesses the ability to mimic human traits like making decisions,
predicting the future, learning, and improving on its own said to have
Informative Intelligence
Knowledge Intelligence
Artificial Intelligence
Emotional Intelligence
49. The Machine is said to be intelligent if,
it collects data
it understands data
 it analyses data
all of the above
50. Which of the following are limitations of AI
i) Training Time

ii) Unemployment

iii) Increasing the work speed

iv) Lack of creativity

a) i, ii and iii

b) i, ii, and iv

c) ii, iii and iv

d) i, iii and iv