AI

MCQ
1. The performance of an agent can be improved by __________
a) Learning
b) Observing
c) Perceiving
d) None of the mentioned
Explanation: An agent can improve by saving the previous states on which it was
earlier, hence in future it can learn to respond in the same situation better

2. External actions of the agent is selected by __________

a) Perceive
b) Performance
c) Learning
d) Actuator
Explanation: It depends on how you want to improve and what the performance
measures are.

3. The action of the Simple reflex agent completely depends upon __________
a) Perception history
b) Current perception
c) Learning theory
d) Utility functions
Explanation: These agents select actions based on the current perception,
ignoring the rest of the perception history.

4. Which of the following could be the approaches to Artificial Intelligence?

a) Strong Artificial Intelligence
b) Weak Artificial Intelligence
c) Applied Artificial Intelligence
d) All of the mentioned

1 Minders’22 AC
Explanation: Strong Artificial Intelligence aims to build machines that can truly
reason and solve problems.
Weak Artificial Intelligence deals with the creation of some form of computer-
based artificial intelligence that cannot truly reason and solve problems, but can
act as if it were intelligent.
Applied Artificial Intelligence aims to produce commercially viable “smart”
systems.
In the Cognitive Artificial Intelligence approach, a computer is used to test
theories about how the human mind works.

5. An Artificial Neural Network Is based on?

a) Strong Artificial Intelligence approach
b) Weak Artificial Intelligence approach
c) Cognitive Artificial Intelligence approach
d) Applied Artificial Intelligence approach
Explanation: In the Cognitive Artificial Intelligence approach, a computer is used
to test theories about how the human mind works, for example, theories about
how we recognize faces and other objects, or about how we solve abstract
problems.

6. The Face Recognition system is based on?

a) Strong Artificial Intelligence approach
b) Weak Artificial Intelligence approach
c) Cognitive Artificial Intelligence approach
d) Applied Artificial Intelligence approach
Explanation: Applied Artificial Intelligence approach aims to produce
commercially viable “smart” systems such as, for example, a security system that
is able to recognize the faces of people who permitted to enter a particular
building. Applied Artificial Intelligence has already enjoyed considerable success.

7. A completely automated chess engine (Learn from previous games) is based

on?
a) Strong Artificial Intelligence approach
2 Minders’22 AC
 b) Weak Artificial Intelligence approach
c) Cognitive Artificial Intelligence approach
d) Applied Artificial Intelligence approach
Explanation: Strong Artificial Intelligence aims to build machines that can truly
reason and solve problems. These machines must be self-aware and their overall
intellectual ability needs to be indistinguishable from that of a human being.
Strong Artificial Intelligence maintains that suitably programmed machines are
capable of cognitive mental states.

8. A basic line following robot is based on __________

a) Strong Artificial Intelligence approach
b) Weak Artificial Intelligence approach
c) Cognitive Artificial Intelligence approach
d) Applied Artificial Intelligence approach
Explanation: Weak Artificial Intelligence deals with the creation of some form of
computer-based artificial intelligence that cannot truly reason and solve
problems, but can act as if it were intelligent. Weak Artificial Intelligence holds
that suitably programmed machines can simulate human cognition.

9. Which of the following task/tasks Artificial Intelligence could not do yet?

a) Understand natural language robustly
b) Web mining
c) Construction of plans in real time dynamic systems
d) All of the mentioned
Explanation: These are the areas in which need more focus for improvements.

10.What among the following is/are the example of the intelligent agent/agents?
a) Human
b) Robot
c) Autonomous Spacecraft
d) All of the mentioned
Explanation: Humans can be looked upon as agents. They have eyes, ears, skin,
taste buds, etc. for sensors; and hands, fingers, legs, mouth for effectors. Robots

3 Minders’22 AC
are agents. Robots may have camera, sonar, infrared, bumper, etc. for sensors.
They can have grippers, wheels, lights, speakers, etc. for actuators. Autonomous
Spacecraft takes decision on its own based on perceptions.

11.Which instruments are used for perceiving and acting upon the environment?
a) Sensors and Actuators
b) Sensors
c) Perceiver
d) None of the mentioned
Explanation: An agent is anything that can be viewed as perceiving and acting
upon the environment through the sensors and actuators.

12.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
Explanation: An agent’s percept sequence is the complete history of everything
that the agent has ever perceived.

13.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.

14.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

4 Minders’22 AC
Explanation: Simple reflex agent is based on the present condition and so it is
condition action rule.

15.What are the composition for agents in artificial intelligence?

a) Program
b) Architecture
c) Both Program & Architecture
d) None of the mentioned
Explanation: An agent program will implement function mapping percepts to
actions.

16.In which agent does the problem generator is present?

a) Learning agent
b) Observing agent
c) Reflex agent
d) None of the mentioned
Explanation: Problem generator will give the suggestion to improve the output
for learning agent.

17.Which is used to improve the agents performance?

a) Perceiving
b) Learning
c) Observing
d) None of the mentioned
Explanation: An agent can improve its performance by storing its previous
actions.

18.Which agent deals with happy and unhappy states?

a) Simple reflex agent
b) Model based agent
c) Learning agent
d) Utility based agent

5 Minders’22 AC
Explanation: A utility function maps a state onto a real number which describes
the associated degree of happiness.

19.Which action sequences are used to achieve the agent’s goal?

a) Search
b) Plan
c) Retrieve
d) Both Search & Plan
Explanation: When the environment becomes more tricky means, the agent
needs plan and search action sequence to achieve the goal.

20.Which element in the agent are used for selecting external actions?
a) Perceive
b) Performance
c) Learning
d) Actuator

21.What is Artificial intelligence?

a) Putting your intelligence into Computer
b) Programming with your own intelligence
c) Making a Machine intelligent
d) Playing a Game
Explanation: Because AI is to make things work automatically through machine
without using human effort. Machine will give the result with just giving input
from human. That means the system or machine will act as per the requirement.

22.Which is not the commonly used programming language for AI?

a) PROLOG
b) Java
c) LISP
d) Perl
Explanation: Because Perl is used as a script language, and not of much use for AI
practice. All others are used to generate an artificial program.

6 Minders’22 AC
23.Artificial Intelligence has its expansion in the following application.
a) Planning and Scheduling
b) Game Playing
c) Diagnosis
d) All of the mentioned
Explanation: All sectors require intelligence and automation for its working.

24.What is an ‘agent’?
a) Perceives its environment through sensors and acting upon that
environment through actuators
b) Takes input from the surroundings and uses its intelligence and performs
the desired operations
c) A embedded program controlling line following robot
d) All of the mentioned
Explanation: An agent is anything that can be viewed as perceiving and acting
upon the environment through the sensors and actuators. Mean it takes input
from its environment through sensors, performs operation and gives output
through actuators.

25.Agents behavior can be best described by ____________

a) Perception sequence
b) Agent function
c) Sensors and Actuators
d) Environment in which agent is performing.
Explanation: An agent’s behavior is described by the agent function that maps
any given percept sequence to an action, which can be implemented by agent
program. The agent function is an abstract mathematical description; the agent
program is a concrete implementation, running on the agent architecture.

26.Rational agent is the one who always does the right thing.
a) True
b) False

7 Minders’22 AC
Explanation: Rational agent is the one who always does the right thing Right in a
sense that it makes the agent the most successful.

27.Performance Measures are fixed for all agents.

a) True
b) False
Explanation: As a general rule, it is better to design performance measures
according to what one actually wants in the environment, rather than according
to how one thinks the agent should behave.

28.What is rational at any given time depends on?

a) The performance measure that defines the criterion of success
b) The agent’s prior knowledge of the environment
c) The actions that the agent can perform
d) All of the mentioned
Explanation: For each possible percept sequence, a rational agent should select
an action that is expected to maximize its performance measure, given the
evidence provided by the percept sequence and whatever built-in knowledge the
agent has.

29.An omniscient agent knows the actual outcome of its actions and can act
accordingly; but omniscience is impossible in reality. Rational Agent always
does the right thing; but Rationality is possible in reality.
a) True
b) False
Explanation: Refer the definition of rational and omniscient agents.

30.The Task Environment of an agent consists of ____________

a) Sensors
b) Actuators
c) Performance Measures
d) All of the mentioned

8 Minders’22 AC
Explanation: The task environment of an agent is described by four parts
performance measures, sensors, actuators and environment, generally known as
the PEAS descriptions.

31.What could possibly be the environment of a Satellite Image Analysis System?

a) Computers in space and earth
b) Image categorization techniques
c) Statistical data on image pixel intensity value and histograms
d) All of the mentioned
Explanation: An environment is something which agent stays in.

32.Categorize Crossword puzzle in Fully Observable / Partially Observable.

a) Fully Observable
b) partially Observable
c) All of the mentioned
d) None of the mentioned
Explanation: In crossword puzzle an agent knows the complete state of the
environment through its sensors

33.The game of Poker is a single agent.

a) True
b) False
Explanation: The game of poker involves multiple player, hence its works in Multi-
agent environment.

34.Satellite Image Analysis System is (Choose the one that is not applicable).
a) Episodic
b) Semi-Static
c) Single agent
d) Partially Observable
Explanation: System knows the current status of the analysis thought its inputs.

9 Minders’22 AC
35.An agent is composed of ________
a) Architecture
b) Agent Function
c) Perception Sequence
d) Architecture and Program
Explanation: An agent is anything that can be viewed as perceiving and acting
upon the environment through the sensors and actuators.

36.Which search agent operates by interleaving computation and action?

a) Offline search
b) Online search
c) Breadth-first search
d) Depth-first search
Explanation: In online search, it will first take an action and then observes the
environment.

37.What is called an exploration problem?

a) State and actions are unknown to the agent
b) State and actions are known to the agent
c) Only actions are known to agent
d) None of the mentioned
Explanation: Online search is a necessary idea for an exploration problem where
the states and actions are unknown to the agent.

38.Which are necessary for an agent to solve an online search problem?

a) Actions
b) Step-cost function
c) Goal-test
d) All of the mentioned
Explanation: An online search problem can be solved by an agent executing
actions, So these functions are necessary.
10 Minders’22 AC
39.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

40.In which state spaces does the online-dfs-agent will work?

a) Irreversible state spaces
b) Reversible state spaces
c) Searchable state spaces
d) All of the mentioned
Explanation: Online-DFS-Agent will work only state spaces where the actions are
reversible.

41.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
Explanation: Hill-climbing search algorithm will have only current state in
memory, So it is an online search algorithm.

42.Which search algorithm will use limited amount of memory?

a) RBFS
b) SMA*
c) Hill-climbing search algorithm
d) Both RBFS & SMA*
Explanation: RBFE and SMA* will solve any kind of problem that A* can’t by using
limited amount of memory.

11 Minders’22 AC
43.What is meant by simulated annealing in artificial intelligence?
a) Returns an optimal solution when there is a proper cooling schedule
b) Returns an optimal solution when there is no proper cooling schedule
c) It will not return an optimal solution when there is a proper cooling
schedule
d) None of the mentioned

44.How the new states are generated in genetic algorithm?

a) Composition
b) Mutation
c) Cross-over
d) Both Mutation & Cross-over
Explanation: New states are generated by mutation and by crossover, which
combines a pair of states from the population.

45.Which method is effective for escaping from local minima?

a) Updating heuristic estimate
b) Reducing heuristic estimate
c) Eliminating heuristic estimate
d) None of the mentioned
Explanation: Updating heuristic estimates from experience provides an effective
method to escape from local minima.

46.Which depends on the percepts and actions available to the agent?

a) Agent
b) Sensor
c) Design problem
d) None of the mentioned
Explanation: The design problem depends on the percepts and actions available
to the agent, the goals that the agent’s behavior should satisfy.

12 Minders’22 AC
47.Which were built in such a way that humans had to supply the inputs and
interpret the outputs?
a) Agents
b) AI system
c) Sensor
d) Actuators
Explanation: AI systems were built in such a way that humans had to supply the
inputs and interpret the outputs.

48.Which technology uses miniaturized accelerometers and gyroscopes?

a) Sensors
b) Actuators
c) MEMS
d) None of the mentioned
Explanation: Micro Electro-Mechanical System uses miniaturized accelerometers
and gyroscopes and is used to produce actuators.

49.What is used for tracking uncertain events?

a) Filtering algorithm
b) Sensors
c) Actuators
d) None of the mentioned
Explanation: Filtering algorithm is used for tracking uncertain events because in
this the real perception is involved.

50.What is not represented by using propositional logic?

a) Objects
b) Relations
c) Both Objects & Relations
d) None of the mentioned

13 Minders’22 AC
Explanation: Objects and relations are not represented by using propositional
logic explicitly.

51.Which functions are used as preferences over state history?

a) Award
b) Reward
c) Explicit
d) Implicit
Explanation: Reward functions may be that preferences over states are really
compared from preferences over state histories.

52.Which kind of agent architecture should an agent an use?

a) Relaxed
b) Logic
c) Relational
d) All of the mentioned
Explanation: Because an agent may experience any kind of situation, So that an
agent should use all kinds of architecture.

53.Specify the agent architecture name that is used to capture all kinds of actions.
a) Complex
b) Relational
c) Hybrid
d) None of the mentioned
Explanation: A complete agent must be able to do anything by using hybrid
architecture.

54.Which agent enables the deliberation about the computational entities and
actions?
a) Hybrid
b) Reflective

14 Minders’22 AC
 c) Relational
d) None of the mentioned
Explanation: Because it enables the agent to capture within itself.

55.What can operate over the joint state space?

a) Decision-making algorithm
b) Learning algorithm
c) Complex algorithm
d) Both Decision-making & Learning algorithm
Explanation: Decision-making and learning algorithms can operate over the joint
state space and thereby serve to implement and used to improve the
computational activities

56.What is the action of task environment in artificial intelligence?

a) Problem
b) Solution
c) Agent
d) Observation
Explanation: Task environments will pose a problem and rational agent will find
the solution for the posed problem.

57.What is the expansion if PEAS in task environment?

a) Peer, Environment, Actuators, Sense
b) Perceiving, Environment, Actuators, Sensors
c) Performance, Environment, Actuators, Sensors
d) None of the mentioned
Explanation: Task environment will contain PEAS which is used to perform the
action independently.

15 Minders’22 AC
58.What kind of observing environments are present in artificial intelligence?
a) Partial
b) Fully
c) Learning
d) Both Partial & Fully
Explanation: Partial and fully observable environments are present in artificial
intelligence.

59.What kind of environment is strategic in artificial intelligence?

a) Deterministic
b) Rational
c) Partial
d) Stochastic
Explanation: If the environment is deterministic except for the action of other
agent is called deterministic.

60.What kind of environment is crossword puzzle?

a) Static
b) Dynamic
c) Semi Dynamic
d) None of the mentioned
Explanation: As the problem in crossword puzzle are posed at beginning itself, So
it is static.

61.What kind of behavior does the stochastic environment posses?

a) Local
b) Deterministic
c) Rational
d) Primary
Explanation: Stochastic behavior are rational because it avoids the pitfall of
predictability.
16 Minders’22 AC
62.Which is used to select the particular environment to run the agent?
a) Environment creator
b) Environment Generator
c) Both Environment creator & Generator
d) None of the mentioned

63.Which environment is called as semi dynamic?

a) Environment does not change with the passage of time
b) Agent performance changes
c) Environment will be changed
d) Environment does not change with the passage of time, but Agent
performance changes
Explanation: If the environment does not change with the passage of time, but
the agent performance changes by time.

64.Where does the performance measure is included?

a) Rational agent
b) Task environment
c) Actuators
d) Sensor
Explanation: In PEAS, Where P stands for performance measure which is always
included in task environment.

65.Which is used to provide the feedback to the learning element?

a) Critic
b) Actuators
c) Sensor
d) None of the mentioned
Explanation: The learning element gets the feedback from the critic which is
presented in the environment on how the agent is doing.

17 Minders’22 AC
66.What is the main task of a problem-solving agent?
a) Solve the given problem and reach to goal
b) To find out which sequence of action will get it to the goal state
c) All of the mentioned
d) None of the mentioned
Explanation: The problem-solving agents are one of the goal-based agents.

67.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
Explanation: Because state space is mostly concerned with a problem, when you
try to solve a problem, we have to design a mathematical structure to the
problem, which can only be through variables and parameters. eg. You have given
a 4-gallon jug and another 3-gallon jug. Neither has measuring marker on it. You
have to fill the jugs with water. How can you get exactly 2 gallons of water in to 4
gallons. Here the state space can defined as set of ordered pairs integers(x,y),
such that x=0,1,2,3 or 4 and y=0,1,2 or 3; X represents the number of gallons in 4
gallon jug and y represents the quantity of water in the 3-gallon jug.

68.The problem-solving agent with several immediate options of unknown value

can decide what to do by just examining different possible sequences of actions
that lead to states of known value, and then choosing the best sequence. This
process of looking for such a sequence is called Search.
a) True
b) False
Explanation: Refer to the definition of problem-solving agent.

18 Minders’22 AC
69.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
Explanation: A search algorithm takes input as a problem and returns a solution
to the problem as an output.
70.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
Explanation: A problem has four components initial state, goal test, set of actions,
path cost.

71.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
Explanation: The most common formulation for actions uses a successor function.
Given a particular state x, SUCCESSOR-FN(x) returns a set of (action, successor)
ordered pairs, where each action is one of the legal actions in state x and each
successor is a state that can be reached from x by applying the action.

72.A solution to a problem is a path from the initial state to a goal state. Solution
quality is measured by the path cost function, and an optimal solution has the
highest path cost among all solutions.

19 Minders’22 AC
 a) True
b) False
Explanation: A solution to a problem is a path from the initial state to a goal state.
Solution quality is measured by the path cost function, and an optimal solution
has the lowest path cost among all solutions.

73.The process of removing detail from a given state representation is called

______
a) Extraction
b) Abstraction
c) Information Retrieval
d) Mining of data
Explanation: The process of removing detail from a representation is called
abstraction.

74.A problem solving approach works well for ______________

a) 8-Puzzle problem
b) 8-queen problem
c) Finding a optimal path from a given source to a destination
d) Mars Hover (Robot Navigation)
Explanation: Problem-solving approach works well for toy problems and real-
world problems.

75.The _______ is a touring problem in which each city must be visited exactly
once. The aim is to find the shortest tour.
a) Finding shortest path between a source and a destination
b) Travelling Salesman problem
c) Map coloring problem
d) Depth first search traversal on a given map represented as a graph
Explanation: Refer the TSP problem.

20 Minders’22 AC
76.Web Crawler is a/an ____________
a) Intelligent goal-based agent
b) Problem-solving agent
c) Simple reflex agent
d) Model based agent
Explanation: Web Crawling is type of search for a relevant document from given
seed documents. Focused crawlers exists, helps to improvise the search
efficiency.

77.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
Explanation: For best performance consideration of all component is necessary.

78.A production rule consists of ____________

a) A set of Rule
b) A sequence of steps
c) Set of Rule & sequence of steps
d) Arbitrary representation to problem
Explanation: When you are trying to solve a problem, you should design how to
get a step-by-step solution with constraints condition to your problem, e.g Chess
board problem.

79.Which search method takes less memory?

a) Depth-First Search
b) Breadth-First search
c) Linear Search
d) Optimal search

21 Minders’22 AC
Explanation: Depth-First Search takes less memory since only the nodes on the
current path are stored, but in Breadth First Search, all of the tree that has
generated must be stored.

80.Which is the best way to go for Game playing problem?

a) Linear approach
b) Heuristic approach (Some knowledge is stored)
c) Random approach
d) An Optimal approach
Explanation: We use a Heuristic approach, as it will find out brute force
computation, looking at hundreds of thousands of positions. e.g Chess
competition between Human and AI based Computer.

81.Which search strategy is also called as blind search?

a) Uninformed search
b) Informed search
c) Simple reflex search
d) All of the mentioned
Explanation: In blind search, We can search the states without having any
additional information. So uninformed search method is blind search.

82.How many types are available in uninformed search method?

a) 3
b) 4
c) 5
d) 6
Explanation: The five types of uninformed search method are Breadth-first,
Uniform-cost, Depth-first, Depth-limited and Bidirectional search.

83.Which search is implemented with an empty first-in-first-out queue?

a) Depth-first search

22 Minders’22 AC
 b) Breadth-first search
c) Bidirectional search
d) None of the mentioned
Explanation: Because of FIFO queue, it will assure that the nodes that are visited
first will be expanded first.

84.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
Explanation: Because it always expands the shallowest unexpanded node.

85.How many successors are generated in backtracking search?

a) 1
b) 2
c) 3
d) 4
Explanation: Each partially expanded node remembers which successor to
generate next because of these conditions, it uses less memory.

86.What is the space complexity of Depth-first 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.

23 Minders’22 AC
87.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.

88.Which algorithm is used to solve any kind of problem?

a) Breadth-first algorithm
b) Tree algorithm
c) Bidirectional search algorithm
d) None of the mentioned
Explanation: Tree algorithm is used because specific variants of the algorithm
embed different strategies.

89.Which search algorithm imposes a fixed depth limit on nodes?

a) Depth-limited search
b) Depth-first search
c) Iterative deepening search
d) Bidirectional search

90.Which search implements stack operation for searching the states?

a) Depth-limited search
b) Depth-first search
c) Breadth-first search
d) None of the mentioned
Explanation: It implements stack operation because it always expands the
deepest node in the current tree.

24 Minders’22 AC
91. What is the general term of Blind searching?
a) Informed Search
b) Uninformed Search
c) Informed & Unformed Search
d) Heuristic Search
Explanation: In case of uninformed search no additional information except the
problem definition is given.

92.Strategies that know whether one non-goal state is “more promising” than
another are called ___________
a) Informed & Unformed Search
b) Unformed Search
c) Heuristic & Unformed Search
d) Informed & Heuristic Search
Explanation: Strategies that know whether one non-goal state is “more
promising” than another are called informed search or heuristic search strategies.

93.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
Explanation: Several uninformed search techniques includes BFS, DFS, Uniform-
cost, Depth-limited, Bidirectional search etc.

94.Which data structure conveniently used to implement BFS?

a) Stacks
b) Queues
c) Priority Queues
d) All of the mentioned

25 Minders’22 AC
Explanation: Queue is the most convenient data structure, but memory used to
store nodes can be reduced by using circular queues.

95.Which data structure conveniently used to implement DFS?

a) Stacks
b) Queues
c) Priority Queues
d) All of the mentioned
Explanation: DFS requires node to be expanded the one most recent visited,
hence stack is convenient to implement.

96.The time and space complexity of BFS is (For time and space complexity
problems consider b as branching factor and d as depth of the search tree.)
a) O(bd+1) and O(bd+1)
b) O(b2) and O(d2)
c) O(d2) and O(b2)
d) O(d2) and O(d2)
Explanation: We consider a hypothetical state space where every state has b
successors. The root of the search tree generates b nodes at the first level, each
of which generates b more nodes, for a total of b2 at the second level. Each of
these generates b more nodes, yielding b3 nodes at the third level, and so on.
Now suppose that the solution is at depth d. In the worst case, we would expand
all but the last node at level d (since the goal itself is not expanded), generating
bd+1- b nodes at level d+1.

97.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.

26 Minders’22 AC
98.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.

99.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
Explanation: Depth-first search always expands the deepest/leaf node in the
current fringe of the search tree.

100.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
Explanation: Breadth-first search always expands the shallowest node in the
current fringe of the search tree. Traversal is performed level wise.

101.Optimality of BFS is ___________

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

27 Minders’22 AC
Explanation: It always expands the shallowest unexpanded node.

102.LIFO is ______ where as FIFO is ________

a) Stack, Queue
b) Queue, Stack
c) Priority Queue, Stack
d) Stack. Priority Queue
Explanation: LIFO is last in first out – Stack. FIFO is first in first out – Queue.

103.When the environment of an agent is partially observable in search space

following problem/problems could occur.
a) Sensor less problems: If the agent has no sensors at all, then (as far as it
knows) it could be in one of several possible initial states, and each action
might therefore lead to one of several possible successor states
b) Contingency problems: If the environment is partially observable or if
actions are uncertain, then the agent’s percepts provide new information
after each action. Each possible percept defines a contingency that must be
planned for. A problem is called adversarial if the uncertainty is caused by
the actions of another agent
c) Exploration problems: When the states and actions of the environment are
unknown, the agent must act to discover them. Exploration problems can
be viewed as an extreme case of contingency problems
d) All of the mentioned

104.For general graph, how one can get rid of repeated states?
a) By maintaining a list of visited vertices
b) By maintaining a list of traversed edges
c) By maintaining a list of non-visited vertices
d) By maintaining a list of non-traversed edges
Explanation: Other techniques are costly.

28 Minders’22 AC
105.DFS is ______ efficient and BFS is __________ efficient.
a) Space, Time
b) Time, Space
c) Time, Time
d) Space, Space

106.The main idea of Bidirectional search is to reduce the time complexity by

searching two way simultaneously from start node and another from goal node.
a) True
b) False
Explanation: The idea behind bidirectional search is to run two simultaneous
searches-one forward from the initial state and the other backward from the goal,
stopping when the two searches meet in the middle. The motivation is that bd/2
+ bd/2 is much less than bd.

107.What is the other name of informed search strategy?

a) Simple search
b) Heuristic search
c) Online search
d) None of the mentioned
Explanation: A key point of informed search strategy is heuristic function, So it is
called as heuristic function.

108.How many types of informed search method are in artificial intelligence?

a) 1
b) 2
c) 3
d) 4
Explanation: The four types of informed search method are best-first search,
Greedy best-first search, A* search and memory bounded heuristic search.

29 Minders’22 AC
109.Which search uses the problem specific knowledge beyond the definition of
the problem?
a) Informed search
b) Depth-first search
c) Breadth-first search
d) Uninformed search
Explanation: Informed search can solve the problem beyond the function
definition, So does it can find the solution more efficiently.

110. Which function will select the lowest expansion node at first for evaluation?
a) Greedy best-first search
b) Best-first search
c) Depth-first search
d) None of the mentioned
Explanation: The lowest expansion node is selected because the evaluation
measures distance to the goal.

111.What is the heuristic function of greedy best-first search?

a) f(n) != h(n)
b) f(n) < h(n)
c) f(n) = h(n)
d) f(n) > h(n)

112.Which search uses only the linear space for searching?

a) Best-first search
b) Recursive best-first search
c) Depth-first search
d) None of the mentioned
Explanation: Recursive best-first search will mimic the operation of standard best-
first search, but using only the linear space.

30 Minders’22 AC
113.Which method is used to search better by learning?
a) Best-first search
b) Depth-first search
c) Metalevel state space
d) None of the mentioned
Explanation: This search strategy will help to problem solving efficiency by using
learning.

114.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

115.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.

116.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.

31 Minders’22 AC
117.A heuristic is a way of trying ___________
a) To discover something or an idea embedded in a program
b) To search and measure how far a node in a search tree seems to be from a
goal
c) To compare two nodes in a search tree to see if one is better than another
d) All of the mentioned
Explanation: In a heuristic approach, we discover certain idea and use heuristic
functions to search for a goal and predicates to compare nodes.

118.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.

119.The search strategy the uses a problem specific knowledge is known as

___________
a) Informed Search
b) Best First Search
c) Heuristic Search
d) All of the mentioned
Explanation: The problem specific knowledge is also known as Heuristics and
Best-First search uses some heuristic to choose the best node for expansion.

120.Uninformed search strategies are better than informed search strategies.

a) True
b) False
Explanation: Informed search strategies uses some problem specific knowledge,
hence more efficient to finding goals.
32 Minders’22 AC
121.Best-First search is a type of informed search, which uses ________________
to choose the best next node for expansion.
a) Evaluation function returning lowest evaluation
b) Evaluation function returning highest evaluation
c) Evaluation function returning lowest & highest evaluation
d) None of them is applicable
Explanation: Best-first search is an instance of the general TREE-SEARCH or
GRAPH-SEARCH algorithm in which a node is selected for expansion based on an
evaluation function, f (n). Traditionally, the node with the lowest evaluation is
selected for expansion, because the evaluation measures distance to the goal.

122.Best-First search can be implemented using the following data structure.

a) Queue
b) Stack
c) Priority Queue
d) Circular Queue
Explanation: Best-first search can be implemented within our general search
framework via a priority queue, a data structure that will maintain the fringe in
ascending order of f-values.

123.The name “best-first search” is a venerable but inaccurate one. After all, if we
could really expand the best node first, it would not be a search at all; it would be
a straight march to the goal. All we can do is choose the node that appears to be
best according to the evaluation function.
a) True
b) False
Explanation: If the evaluation function is exactly accurate, then this will indeed be
the best node; in reality, the evaluation function will sometimes be off, and can
lead the search astray.

33 Minders’22 AC
124.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
Explanation: Heuristic is an estimated cost.

125.Greedy search strategy chooses the node for expansion in ___________

a) Shallowest
b) Deepest
c) The one closest to the goal node
d) Minimum heuristic cost
Explanation: Sometimes minimum heuristics can be used, sometimes maximum
heuristics function can be used. It depends upon the application on which the
algorithm is applied.

126.What is the evaluation function in greedy approach?

a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost
Explanation: Greedy best-first search3 tries to expand the node that is closest to
the goal, on the grounds that this is likely to lead to a solution quickly. Thus, it
evaluates nodes by using just the heuristic function: f (n) = h(n).

127.What is the space complexity of Greedy search?

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

34 Minders’22 AC
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.

128.What is the evaluation function in A* approach?

a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost
Explanation: The most widely-known form of best-first search is called A* search.
It evaluates nodes by combining g(n), the cost to reach the node, and h(n.), the
cost to get from the node to the goal: f(n) = g(n) + h(n). Since g(n) gives the path
cost from the start node to node n, and h(n) is the estimated cost of the cheapest
path from n to the goal.

129.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.

130.In many problems the path to goal is irrelevant, this class of problems can be
solved using ____________
a) Informed Search Techniques
b) Uninformed Search Techniques
c) Local Search Techniques
d) Informed & Uninformed Search Techniques
Explanation: If the path to the goal does not matter, we might consider a
different class of algorithms, ones that do not worry about paths at all. Local
search algorithms operate using a single current state (rather than multiple paths)
and generally move only to neighbors of that state.

35 Minders’22 AC
131.Though local search algorithms are not systematic, key advantages would
include __________
a) Less memory
b) More time
c) Finds a solution in large infinite space
d) Less memory & Finds a solution in large infinite space
Explanation: Two advantages: (1) they use very little memory-usually a constant
amount; and (2) they can often find reasonable solutions in large or infinite
(continuous) state spaces for which systematic algorithms are unsuitable.

132.A complete, local search algorithm always finds goal if one exists, an optimal
algorithm always finds a global minimum/maximum.
a) True
b) False
Explanation: An algorithm is complete if it finds a solution if exists and optimal if
finds optimal goal (minimum or maximum).

133._______________ Is an algorithm, a loop that continually moves in the

direction of increasing value – that is uphill.
a) Up-Hill Search
b) Hill-Climbing
c) Hill algorithm
d) Reverse-Down-Hill search
Explanation: Refer the definition of Hill-Climbing approach.

134.When will Hill-Climbing algorithm terminate?

a) Stopping criterion met
b) Global Min/Max is achieved
c) No neighbor has higher value
d) All of the mentioned

36 Minders’22 AC
Explanation: When no neighbor is having higher value, algorithm terminates
fetching local min/max.

135.What are the main cons of hill-climbing search?

a) Terminates at local optimum & Does not find optimum solution
b) Terminates at global optimum & Does not find optimum solution
c) Does not find optimum solution & Fail to find a solution
d) Fail to find a solution
Explanation: Algorithm terminates at local optimum values, hence fails to find
optimum solution.

136.Stochastic hill climbing chooses at random from among the uphill moves; the
probability of selection can vary with the steepness of the uphil1 move.
a) True
b) False
Explanation: Refer to the definition of variants of hill-climbing search.

137.Hill climbing sometimes called ____________ because it grabs a good

neighbor state without thinking ahead about where to go next.
a) Needy local search
b) Heuristic local search
c) Greedy local search
d) Optimal local search

138.Hill-Climbing approach stuck for which of the following reasons?

a) Local maxima
b) Ridges
c) Plateaux
d) All of the mentioned

37 Minders’22 AC
Explanation: Local maxima: a local maximum is a peak that is higher than each of
its neighboring states, but lower than the global maximum. Ridges: Ridges result
in a sequence of local maxima that is very difficult for greedy algorithms to
navigate. Plateaux: a plateau is an area of the state space landscape where the
evaluation function is flat.

139.___________ algorithm keeps track of k states rather than just one.

a) Hill-Climbing search
b) Local Beam search
c) Stochastic hill-climbing search
d) Random restart hill-climbing search
Explanation: Refer to the definition of Local Beam Search algorithm.

140.A genetic algorithm (or GA) is a variant of stochastic beam search in which
successor states are generated by combining two parent states, rather than by
modifying a single state.
a) True
b) False
Explanation: Stochastic beam search, analogous to stochastic hill climbing, helps
to alleviate this problem. Instead of choosing the best k from the pool of
candidate successors, stochastic beam search chooses k successors at random,
with the probability of choosing a given successor being an increasing function of
its value.

141.What are the two main features of Genetic Algorithm?

a) Fitness function & Crossover techniques
b) Crossover techniques & Random mutation
c) Individuals among the population & Random mutation
d) Random mutation & Fitness function
Explanation: Fitness function helps choosing individuals from the population and
Crossover techniques defines the offspring generated.

38 Minders’22 AC
142.Searching using query on Internet is, use of ___________ type of agent.
a) Offline agent
b) Online agent
c) Both Offline & Online agent
d) Goal Based & Online agent
Explanation: Refer to the definitions of both the type of agent.

143.General games involves ____________

a) Single-agent
b) Multi-agent
c) Neither Single-agent nor Multi-agent
d) Only Single-agent and Multi-agent
Explanation: Depending upon games it could be single agent (Sudoku) or multi-
agent (Chess).

144.Adversarial search problems uses ____________

a) Competitive Environment
b) Cooperative Environment
c) Neither Competitive nor Cooperative Environment
d) Only Competitive and Cooperative Environment
Explanation: Since in cooperative environment agents’ goals are I conflicts. They
compete for goal.

145.Mathematical game theory, a branch of economics, views any multi-agent

environment as a game provided that the impact of each agent on the others is
“significant,” regardless of whether the agents are cooperative or competitive.
a) True
b) False

39 Minders’22 AC
146.Zero sum games are the one in which there are two agents whose actions
must alternate and in which the utility values at the end of the game are always
the same.
a) True
b) False
Explanation: Utility values are always same and opposite.

147.Zero sum game has to be a ______ game.

a) Single player
b) Two player
c) Multiplayer
d) Three player
Explanation: Zero sum games could be multiplayer games as long as the condition
for zero sum game is satisfied.

148.A game can be formally defined as a kind of search problem with the
following components.
a) Initial State
b) Successor Function
c) Terminal Test
d) All of the mentioned
Explanation: The initial state includes the board position and identifies the player
to move. A successor function returns a list of (move, state) pairs, each indicating
a legal move and the resulting state. A terminal test determines when the game is
over. States where the game has ended are called terminal states. A utility
function (also called an objective function or payoff function), which gives a
numeric value for the terminal states. In chess, the outcome is a win, lose, or
draw, with values +1, -1, or 0.

40 Minders’22 AC
149.The initial state and the legal moves for each side define the __________ for
the game.
a) Search Tree
b) Game Tree
c) State Space Search
d) Forest
Explanation: An example of game tree for Tic-Tac-Toe game.

150.General algorithm applied on game tree for making decision of win/lose is

____________
a) DFS/BFS Search Algorithms
b) Heuristic Search Algorithms
c) Greedy Search Algorithms
d) MIN/MAX Algorithms
Explanation: Given a game tree, the optimal strategy can be determined by
examining the min/max value of each node, which we write as MINIMAX-
VALUE(n). The min/max value of a node is the utility (for MAX) of being in the
corresponding state, assuming that both players play optimally from there to the
end of the game. Obviously, the min/max value of a terminal state is just its
utility. Furthermore, given a choice, MAX will prefer to move to a state of
maximum value, whereas MIN prefers a state of minimum value.

151.The minimax algorithm computes the minimax decision from the current
state. It uses a simple recursive computation of the minimax values of each
successor state, directly implementing the defining equations. The recursion
proceeds all the way down to the leaves of the tree, and then the minimax values
are backed up through the tree as the recursion unwinds.
a) True
b) False
Explanation: Refer definition of minimax algorithm.

41 Minders’22 AC
152.What is the complexity of minimax algorithm?
a) Same as of DFS
b) Space – bm and time – bm
c) Time – bm and space – bm
d) Same as BFS
Explanation: Same as DFS.

153.Which is the most straightforward approach for planning algorithm?

a) Best-first search
b) State-space search
c) Depth-first search
d) Hill-climbing search
Explanation: The straightforward approach for planning algorithm is state space
search because it takes into account of everything for finding a solution.

154.What are taken into account of state-space search?

a) Postconditions
b) Preconditions
c) Effects
d) Both Preconditions & Effects
Explanation: The state-space search takes both precondition and effects into
account for solving a problem.

155.How many ways are available to solve the state-space search?

a) 1
b) 2
c) 3
d) 4
Explanation: There are two ways available to solve the state-space search. They
are forward from the initial state and backward from the goal.

42 Minders’22 AC
156.What is the other name for forward state-space search?
a) Progression planning
b) Regression planning
c) Test planning
d) None of the mentioned
Explanation: It is sometimes called as progression planning, because it moves in
the forward direction.

157.How many states are available in state-space search?

a) 1
b) 2
c) 3
d) 4
Explanation: There are four states available in state-space search. They are initial
state, actions, goal test and step cost.

158.What is the main advantage of backward state-space search?

a) Cost
b) Actions
c) Relevant actions
d) All of the mentioned
Explanation: The main advantage of backward search will allow us to consider
only relevant actions.

159.What is the other name of the backward state-space search?

a) Regression planning
b) Progression planning
c) State planning
d) Test planning
Explanation: Backward state-space search will find the solution from goal to the
action, So it is called as Regression planning.
43 Minders’22 AC
160.Which search is equal to minimax search but eliminates the branches that
can’t influence the final decision?
a) Depth-first search
b) Breadth-first search
c) Alpha-beta pruning
d) None of the mentioned
Explanation: The alpha-beta search computes the same optimal moves as
minimax, but eliminates the branches that can’t influence the final decision.

161.Which values are independent in minimax search algorithm?

a) Pruned leaves x and y
b) Every states are dependent
c) Root is independent
d) None of the mentioned
Explanation: The minimax decision are independent of the values of the pruned
values x and y because of the root values.

162.To which depth does the alpha-beta pruning can be applied?

a) 10 states
b) 8 States
c) 6 States
d) Any depth
Explanation: Alpha–beta pruning can be applied to trees of any depth and it is
possible to prune entire subtree rather than leaves.

163.Which search is similar to minimax search?

a) Hill-climbing search
b) Depth-first search
c) Breadth-first search
d) All of the mentioned

44 Minders’22 AC
Explanation: The minimax search is depth-first search, So at one time we just
have to consider the nodes along a single path in the tree.

164.Which value is assigned to alpha and beta in the alpha-beta pruning?

a) Alpha = max
b) Beta = min
c) Beta = max
d) Both Alpha = max & Beta = min
Explanation: Alpha and beta are the values of the best choice we have found so
far at any choice point along the path for MAX and MIN.

165.Where does the values of alpha-beta search get updated?

a) Along the path of search
b) Initial state itself
c) At the end
d) None of the mentioned
Explanation: Alpha-beta search updates the value of alpha and beta as it gets
along and prunes the remaining branches at node.

166.How the effectiveness of the alpha-beta pruning gets increased?

a) Depends on the nodes
b) Depends on the order in which they are executed
c) All of the mentioned
d) None of the mentioned

167.What is called as transposition table?

a) Hash table of next seen positions
b) Hash table of previously seen positions
c) Next value in the search
d) None of the mentioned

45 Minders’22 AC
Explanation: Transposition is the occurrence of repeated states frequently in the
search.

168.Which is identical to the closed list in Graph search?

a) Hill climbing search algorithm
b) Depth-first search
c) Transposition table
d) None of the mentioned

169.Which function is used to calculate the feasibility of whole game tree?

a) Evaluation function
b) Transposition
c) Alpha-beta pruning
d) All of the mentioned
Explanation: Because we need to cut the search off at some point and apply an
evaluation function that gives an estimate of the utility of the state.

170.What is a Cybernetics?
a) Study of communication between two machines
b) Study of communication between human and machine
c) Study of communication between two humans
d) Study of Boolean values
Explanation: Cybernetics is Study of communication between human and
machine.

171.What is the goal of artificial intelligence?

a) To solve real-world problems
b) To solve artificial problems
c) To explain various sorts of intelligence
d) To extract scientific causes

46 Minders’22 AC
Explanation: The scientific goal of artificial intelligence is to explain various sorts
of intelligence.

172.An algorithm is complete if ____________

a) It terminates with a solution when one exists
b) It starts with a solution
c) It does not terminate with a solution
d) It has a loop
Explanation: An Algorithm is complete if It terminates with a solution when one
exists.

173.Which is true regarding BFS (Breadth First Search)?

a) BFS will get trapped exploring a single path
b) The entire tree so far been generated must be stored in BFS
c) BFS is not guaranteed to find a solution if exists
d) BFS is nothing but Binary First Search
Explanation: Regarding BFS-The entire tree so far been generated must be stored
in BFS.

174.What is a heuristic function?

a) A function to solve mathematical problems
b) A function which takes parameters of type string and returns an integer
value
c) A function whose return type is nothing
d) A function that maps from problem state descriptions to measures of
desirability
Explanation: Heuristic function is a function that maps from problem state
descriptions to measures of desirability.

47 Minders’22 AC
175.The traveling salesman problem involves n cities with paths connecting the
cities. The time taken for traversing through all the cities, without knowing in
advance the length of a minimum tour, is ___________
a) O(n)
b) O(n2)
c) O(n!)
d) O(n/2)
Explanation: The traveling salesman problem involves n cities with paths
connecting the cities. The time taken for traversing through all the cities, without
knowing in advance the length of a minimum tour, is O(n!).

176.What is the problem space of means-end analysis?

a) An initial state and one or more goal states
b) One or more initial states and one goal state
c) One or more initial states and one or more goal state
d) One initial state and one goal state
Explanation: The problem space of means-end analysis has an initial state and
one or more goal states.

177.An algorithm A is admissible if ___________

a) It is not guaranteed to return an optimal solution when one exists
b) It is guaranteed to return an optimal solution when one exists
c) It returns more solutions, but not an optimal one
d) It guarantees to return more optimal solutions
Explanation: An algorithm A is admissible if It is guaranteed to return an optimal
solution when one exists.

178.Knowledge may be
I. Declarative. II. Procedural. III. Non-procedural.
a) Only (I)
b) Only (II)

48 Minders’22 AC
 c) Only (III)
d) Both (I) and (II)
Explanation: Knowledge may be declarative and procedural.

179.Idempotency law is
I. P Ú P = P. II. P Ù P = P. III. P + P = P.
a) Only (I)
b) Only (II)
c) Only (III)
d) Both (I) and (II)
Explanation: Idempotency Law is P V P = P.

180.What is the primary interactive method of communication used by humans?

a) reading
b) writing
c) speaking
d) all of the mentioned
181.Elementary linguistic units that are smaller than words are?
a) allophones
b) phonemes
c) syllables
d) all of the mentioned

182.In LISP, the atom that stands for “true” is _____________

a) t
b) ml
c) y
d) time

49 Minders’22 AC
183.A mouse device may be _____________
a) electro-chemical
b) mechanical
c) optical
d) both mechanical and optical

184.An expert system differs from a database program in that only an expert
system _____________
a) contains declarative knowledge
b) contains procedural knowledge
c) features the retrieval of stored information
d) expects users to draw their own conclusions

185.Arthur Samuel is linked inextricably with a program that played

_____________
a) checkers
b) chess
c) cricket
d) football

186.Natural language understanding is used in _____________

a) natural language interfaces
b) natural language front ends
c) text understanding systems
d) all of the mentioned

187.Which of the following are examples of software development tools?

a) debuggers
b) editors
c) assemblers, compilers and interpreters
50 Minders’22 AC
 d) all of the mentioned

188.Which is the first AI programming language?

a) BASIC
b) FORTRAN
c) IPL(Inductive logic programming)
d) LISP

189.The Personal Consultant is based on?

a) EMYCIN
b) OPS5+
c) XCON
d) All of the mentioned

190.What is Machine learning?

a) The autonomous acquisition of knowledge through the use of computer
programs
b) The autonomous acquisition of knowledge through the use of manual
programs
c) The selective acquisition of knowledge through the use of computer
programs
d) The selective acquisition of knowledge through the use of manual programs
Explanation: Machine learning is the autonomous acquisition of knowledge
through the use of computer programs.

191.Which of the factors affect the performance of learner system does not
include?
a) Representation scheme used
b) Training scenario
c) Type of feedback

51 Minders’22 AC
 d) Good data structures
Explanation: Factors that affect the performance of learner system does not
include good data structures.

192.Different learning methods does not include?

a) Memorization
b) Analogy
c) Deduction
d) Introduction
Explanation: Different learning methods does not include the introduction.

193.In language understanding, the levels of knowledge that does not include?
a) Phonological
b) Syntactic
c) Empirical
d) Logical
Explanation: In language understanding, the levels of knowledge that does not
include empirical knowledge.

194.A model of language consists of the categories which does not include?
a) Language units
b) Role structure of units
c) System constraints
d) Structural units
Explanation: A model of language consists of the categories which does not
include structural units.

52 Minders’22 AC
195.What is a top-down parser?
a) Begins by hypothesizing a sentence (the symbol S) and successively
predicting lower level constituents until individual preterminal symbols are
written
b) Begins by hypothesizing a sentence (the symbol S) and successively
predicting upper level constituents until individual preterminal symbols are
written
c) Begins by hypothesizing lower level constituents and successively
predicting a sentence (the symbol S)
d) Begins by hypothesizing upper level constituents and successively
predicting a sentence (the symbol S)
Explanation: A top-down parser begins by hypothesizing a sentence (the symbol
S) and successively predicting lower level constituents until individual preterminal
symbols are written.

196.Among the following which is not a horn clause?

a) p
b) Øp V q
c) p→q
d) p → Øq
Explanation: p → Øq is not a horn clause.

197.The action ‘STACK(A, B)’ of a robot arm specify to _______________

a) Place block B on Block A
b) Place blocks A, B on the table in that order
c) Place blocks B, A on the table in that order
d) Place block A on block B
Explanation: The action ‘STACK(A,B)’ of a robot arm specify to Place block A on
block B.

53 Minders’22 AC