Artificial Intelligence Questions – History – 1

This set of Artificial Intelligence Multiple Choice Questions (MCQs) focuses on “History – 1”.

1. In LISP, the function returns the list that results after the first element is removed (the rest of the list),
is __________

2. Which of the following contains the output segments of Artificial Intelligence programming?
a) Printed language and synthesized speech
b) Manipulation of physical object
c) Locomotion
d) All of the mentioned

3. LISP was created by?

a) John McCarthy
b) Marvin Minsky
c) Alan Turing
d) Allen Newell and Herbert Simon

4. Expert Ease was developed under the direction of __________

a) John McCarthy
b) Donald Michie
c) Lofti Zadeh
d) Alan Turing

5. An Artificial Intelligence system developed by Terry A. Winograd to permit an interactive dialogue

about a domain he called blocks-world.
a) SHRDLU
b) SIMD
c) BACON
d) STUDENT

6. MLMenu, a natural language interface for the TI Explorer, is similar to __________

a) Ethernet
b) NaturalLink
c) PROLOG
d) The Personal Consultant

7. Strong Artificial Intelligence is __________

a) the embodiment of human intellectual capabilities within a computer
b) a set of computer programs that produce output that would be considered to reflect intelligence if it
were generated by humans
c) the study of mental faculties through the use of mental models implemented on a computer
d) all of the mentioned

8. The traditional way to exit and LISP system is to enter __________

a) quit
b) exit
c) bye
d) ok

9. In which of the following situations might a blind search be acceptable?

a) real-life situation
b) complex game
c) small search space
d) all of the mentioned

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

11. Which search method takes less memory?

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

12. 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 the other is
d) All of the mentioned

13. How do you represent “All dogs have tails”?

a) ۷x: dog(x) àhastail(x)
b) ۷x: dog(x) àhastail(y)
c) ۷x: dog(y) àhastail(x)
d) ۷x: dog(x) àhasàtail(x)
14. Which is not a property of representation of knowledge?
a) Representational Verification
b) Representational Adequacy
c) Inferential Adequacy
d) Inferential Efficiency
Artificial Intelligence Questions – History – 2

1. A series of Artificial Intelligence systems, developed by Pat Langley to explore the role of heuristics in
scientific discovery is ________
a) RAMD
b) BACON
c) MIT
d) DU

2. A.M. Turing developed a technique for determining whether a computer could or could not
demonstrate the artificial Intelligence, Presently, this technique is called __________
a) Turing Test
b) Algorithm
c) Boolean Algebra
d) Logarithm

3. A Personal Consultant knowledge base contain information in the form of __________

a) parameters
b) contexts
c) production rules
d) all of the mentioned

4. Which approach to speech recognition avoids the problem caused by the variation in speech patterns
among different speakers?
a) Continuous speech recognition
b) Isolated word recognition
c) Connected word recognition
d) Speaker-dependent recognition

5. Which of the following, is a component of an expert system?

a) inference engine
b) knowledge base
c) user interface
d) all of the mentioned

6. A computer vision technique that relies on image templates is __________

a) edge detection
b) binocular vision
c) model-based vision
d) robot vision
7. DARPA, the agency that has funded a great deal of American Artificial Intelligence research, is part of
the Department of __________
a) Defense
b) Energy
c) Education
d) Justice

8. Which of these schools was not among the early leaders in Artificial Intelligence research?
a) Dartmouth University
b) Harvard University
c) Massachusetts Institute of Technology
d) Stanford University

9. A certain Professor at the Stanford University coined the word ‘artificial intelligence’ in 1956 at a
conference held at Dartmouth college. Can you name the Professor?
a) David Levy
b) John McCarthy
c) Joseph Weizenbaum
d) Hans Berliner

10. In LISP, the function (copy-list <list>)

a) returns a new list that is equal to <list> by copying the top-level element of <list>
b) returns the length of <list>
c) returns t if <list> is empty
d) all of the mentioned

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

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

12. In 1985, the famous chess player David Levy beat a world champion chess program in four straight
games by using orthodox moves that confused the program. What was the name of the chess program?
a) Kaissa
b) CRAY BLITZ
c) Golf
d) DIGDUG

13. The explanation facility of an expert system may be used to __________

a) construct a diagnostic model
b) expedite the debugging process
c) explain the system’s reasoning process
d) expedite the debugging process & explain the system’s reasoning process

14. A process that is repeated, evaluated, and refined is called __________

a) diagnostic
b) descriptive
c) interpretive
d) iterative

15. Visual clues that are helpful in computer vision include __________
a) color and motion
b) depth and texture
c) height and weight
d) color and motion, depth and texture
Artificial Intelligence Questions– History – 3

1. The conference that launched the AI revolution in 1956 was held at?
a) Dartmouth
b) Harvard
c) New York
d) Stanford

Explanation: None.

2. Texas Instruments Incorporated produces a low-cost LISP machine called __________

a) The Computer-Based Consultant
b) The Explorer
c) Smalltalk
d) The Personal Consultant

Explanation: None.

3. When a top-level function is entered, the LISP processor do(es)?

a) It reads the function entered
b) It evaluates the function and the function’s operands
c) It prints the results returned by the function
d) All of the mentioned

Explanation: None.

4. One method of programming a computer to exhibit human intelligence is called modeling or

__________
a) simulation
b) cognitization
c) duplication
d) psychic amelioration

Explanation: None.

5. Graphic interfaces were first used in a Xerox product called __________

a) InterLISP
b) Ethernet
c) Smalltalk
d) ZetaLISP

Explanation: None.

6. The Al researcher who co-authored both the Handbook of Artificial Intelligence and The Fifth
Generation is __________
a) Bruce Lee
b) Randy Davis
c) Ed Feigenbaum
d) Mark Fox

Explanation: None.

7. Which of the following is being investigated as a means of automating the creation of a knowledge
base?
a) automatic knowledge acquisition
b) simpler tools
c) discovery of new concepts
d) all of the mentioned

Explanation: None.

8. The CAI (Computer-Assisted Instruction) technique based on programmed instruction is __________

a) frame-based CAI
b) generative CAI
c) problem-solving CAI
d) intelligent CAI

Explanation: None.

9. A robot’s “arm” is also known as its __________

a) end effector
b) actuator
c) manipulator
d) servomechanism

Explanation: None.
10. KEE is a product of __________
a) Teknowledge
b) IntelliCorpn
c) Texas Instruments
d) Tech knowledge

Explanation: None.

11. In LISP, the function X (x). (2x+l) would be rendered as __________

a) (lambda (x) (+(*2 x)l))
b) (lambda (x) (+1 (* 2x)
c) (+ lambda (x) 1 (*2x))
d) (* lambda(x) (+2×1)

Explanation: None.

12. A natural language generation program must decide __________

a) what to say
b) when to say something
c) why it is being used
d) both what to say & when to say something

Explanation: None.

13. The hardware features of LISP machines generally include __________

a) large memory and a high-speed processor
b) letter-quality printers and 8-inch disk drives
c) a mouse and a specialized keyboard
d) large memory and a high-speed processor & a mouse and a specialized keyboard

Explanation: None.

14. In which of the following areas may ICAI programs prove to be useful?
a) educational institutions
b) corporations
c) department of Defense
d) all of the mentioned
Explanation: None.

15. A network with named nodes and labeled arcs that can be used to represent certain natural
language grammars to facilitate parsing.
a) Tree Network
b) Star Network
c) Transition Network
d) Complete Network

Explanation: None.
Artificial Intelligence Questions – Artificial Intelligence Agents

This set of Artificial Intelligence Multiple Choice Questions (MCQs) focuses on “Artificial Intelligence
Agents”.

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

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
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 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.
Artificial Intelligence Questions – Machine Learning

This set of Artificial Intelligence Multiple Choice Questions (MCQs) focuses on “Machine Learning”.

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

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

Explanation: Factors that affect the performance of learner system does not include good data
structures.

3. Different learning methods does not include?

a) Memorization
b) Analogy
c) Deduction
d) Introduction

Explanation: Different learning methods does not include the introduction.

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

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

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

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

8. 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.
Artificial Intelligence Questions – Agents

This set of Artificial Intelligence Multiple Choice Questions (MCQs) focuses on “Agents”.

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

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

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

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

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

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

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

8. Which agent deals with happy and unhappy states?

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

Explanation: A utility function maps a state onto a real number which describes the associated degree of
happiness.

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

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

Explanation: None.
Artificial Intelligence Questions – Intelligent Agents and Environment

This set of Artificial Intelligence Multiple Choice Questions (MCQs) focuses on “Intelligent Agents and
Environment”.

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

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

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

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

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

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

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

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

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

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

10. The Task Environment of an agent consists of ____________

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

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

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

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

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

15. 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.
Artificial Intelligence Questions – Agent Architecture

This set of Artificial Intelligence Multiple Choice Questions (MCQs) focuses on “Agent Architecture”.

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

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

3. Which technology uses miniaturized accelerometers and gyroscopes?

a) Sensors
b) Actuators
c) MEMS
d) None of the mentioned

Explanation: Micro ElectroMechanical System uses miniaturized accelerometers and gyroscopes and is
used to produce actuators.

4. 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.
5. What is not represented by using propositional logic?
a) Objects
b) Relations
c) Both Objects & Relations
d) None of the mentioned

Explanation: Objects and relations are not represented by using propositional logic explicitly.

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

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

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

9. Which agent enables the deliberation about the computational entities and actions?
a) Hybrid
b) Reflective
c) Relational
d) None of the mentioned
Explanation: Because it enables the agent to capture within itself.

10. 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.
Artificial Intelligence Questions – Environments

This set of Artificial Intelligence Multiple Choice Questions (MCQs) focuses on “Environments”.

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

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

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

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

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

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

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

Explanation: None.

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

9. 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.
10. 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.
Artificial Intelligence Questions – Problem Solving

This set of Artificial Intelligence Multiple Choice Questions (MCQs) focuses on “Problem Solving”.

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

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

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

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

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

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

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

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

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

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

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

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

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

14. Which search method takes less memory?

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

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.

15. 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.
Artificial Intelligence Questions – Uninformed Search Strategy

This set of Artificial Intelligence Multiple Choice Questions (MCQs) focuses on “Uninformed Search
Strategy”.

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

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

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

a) Depth-first search
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.

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

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

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

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.

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

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

Explanation: None.

10. 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.
Artificial Intelligence Questions – Uninformed Search and Exploration

This set of Artificial Intelligence Multiple Choice Questions (MCQs) focuses on “Uninformed Search and
Exploration”.

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

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

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

4. Which data structure conveniently used to implement BFS?

a) Stacks
b) Queues
c) Priority Queues
d) All of the mentioned
Explanation: Queue is the most convenient data structure, but memory used to store nodes can be
reduced by using circular queues.

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

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

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

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

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

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

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

Explanation: It always expands the shallowest unexpanded node.

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

13. When the environment of an agent is partially observable in search space following
problem/problems could occur.
a) Sensorless 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

Explanation: None.

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

15. DFS is ______ efficient and BFS is __________ efficient.

a) Space, Time
b) Time, Space
c) Time, Time
d) Space, Space

Explanation: None.

16. 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.
Artificial Intelligence Questions – Informed Search Strategy

This set of Artificial Intelligence Multiple Choice Questions (MCQs) focuses on “Informed Search
Strategy”.

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

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

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

4. 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.
5. 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)

Explanation: None.

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

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

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

Explanation: None.

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

10. 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.
Artificial Intelligence Questions – Informed Search and Exploration

This set of Artificial Intelligence (AI) Questions for Aptitude test focuses on “Informed Search and
Exploration”.

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

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

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

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

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

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

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

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

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

10. 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).

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

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

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