lOMoARcPSD|5982446

CSA UNIT-10 (mcq's) - Exams

Network Analysis (Bangalore University)

Scan to open on Studocu

Studocu is not sponsored or endorsed by any college or university

Downloaded by Prudhvi Dil ([email protected])
 lOMoARcPSD|5982446

DIWAKAARTIFIAL INTELLIGENCE (AI) (MCQ’S)

Unit - 10

To join Test Series

Download ‘Global Online’ app

Or

@ paid WhatsApp group 8179138413A

KAR

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

1. The technology that has the ability reactivity.

to interact with the world. a) AI
a) AI b) Autonomous Agent
b) ML c) Agency
c) IOT d) Behavior Engineering
d) IT
Answer: b
Answer: a Explanation: The answer is
Explanation: AI which is artificial Autonomous Agent. Autonomous
intelligence is the ability to interact agent has autonomy i.e. ability to
with the world. It is the ability to operate without the direct
model the world and to learn and intervention of humans or others.
adapt.
5. A particular system that contains
2. The goal of AI is to build systems intelligent agents.
that exhibit intelligent behavior. a) AI systems
a) True b) Agency
b) False c) Autonomous systems
d) Company
Answer: a
Explanation: The statement is true. Answer: b
There are 2 main goals in AI: to Explanation: It is called an agency. A
exhibit intelligent behavior and particular system consisting of
understand intelligence in order to intelligent agents like computers or
model it. robots that cooperate to find the
solution to a problem.
3. The first neural network computer.
a) RFD 6. A methodology used to develop
b) SNARC behavior-based autonomous agents.
c) AM a) Descriptors
d) AN b) Behavior engineering
c) Behavior modeling
Answer: b d) Auto engineering
Explanation: SNARC was the first
neural network computer. it was built Answer: b
by Minsky and Edmonds in 1956. Explanation: The answer is behavior
engineering. Autonomous agent
4. A hardware based system that has
autonomy, social ability and

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

implements autonomy, social ability to learn and improve. The same is

and reactivity. implemented on its agents.
7. An international research effort to 10. Face recognition system is based
promote autonomous robots. on
a) Fresh Kitty a) applied AI
b) RoboCup b) parallel AI
c) AICup c) serial AI
d) SPOT d) strong AI

Answer: b Answer: a
Explanation: RoboCup is designed to Explanation: The answer is applied AI.
promote autonomous robots. It is It is based on applied artificial
based on multi agent collaboration. intelligence. It is an approach to
develop commercially smart systems.
8. A type of non-monotonic
reasoning. 11. Which of the following is an
a) Ordinary extension of the semantic network?
b) Special a) Expert Systems
c) Duplicate
b) Rule Based Expert Systems
d) Default
c) Decision Tree Based networks
Answer: d d) Partitioned Networks
Explanation: Default reasoning is a
Answer: d
type of non-monotonic reasoning.
Default logic is a non-monotonic logic Explanation: None.
proposed by Raymond Reiter to 12. Basic idea of an partitioned nets is
formalize reasoning with default
to break network into spaces which
assumptions.
consist of groups of nodes and arcs
9. The performance of an agent can and regard each space as a node.
be improved based on this.
a) True
a) Observe
b) False
b) Learn
c) Improvise Answer: a
d) Implement
Explanation: None.
Answer: b
Explanation: An AI system is designed
3

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

13. Semantic Network represents Rule-based system. Global attribute

_ defines a particular problem space as
a) Syntactic relation between user specific and changes according
concepts to user‟s plan to problem.
b) Semantic relations between
15. How is Fuzzy Logic different from
concepts
conventional control methods?
c) All of the mentioned
a) IF and THEN Approach
d) None of the mentioned
b) FOR Approach
Answer: b c) WHILE Approach
Explanation: None. d) DO Approach

14. Which is not a desirable property Answer: a

of a logical rule-based system? Explanation: FL incorporates a simple,
a) Locality rule-based IF X AND Y THEN Z
b) Attachment approach to a solving control
c) Detachment problem rather than attempting to
d) Truth-Functionality model a system mathematically.

Answer: b 16. In an Unsupervised learning

Explanation: Locality: In logical
systems, whenever we have a rule of a) Specific output values are given
the form A => B, we can conclude B, b) Specific output values are not
given evidence A, without worrying given
about any other rules. Detachment: c) No specific Inputs are given
Once a logical proof is found for a d) Both inputs and outputs are given
proposition B, the proposition can be
Answer: b
used regardless of how it was derived
Explanation: The problem of
.That is, it can be detachment from its
unsupervised learning involves
justification. Truth-functionality: In
learning patterns in the input when
logic, the truth of complex sentences
no specific output values are
can be computed from the truth of
supplied. We cannot expect the
the components. However, there are
specific output to test your result.
no Attachment properties lies in a

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Here the agent does not know what complexity of inductive learning.
to do, as he is not aware of the fact There is a tradeoff between the
what propose system will come out. expressiveness of the hypothesis
We can say an ambiguous un- language and the ease of learning.
proposed situation.
19. If a hypothesis says it should be
17. Inductive learning involves finding positive, but in fact, it is negative, we
a call it
a) Consistent Hypothesis a) A consistent hypothesis
b) Inconsistent Hypothesis b) A false negative hypothesis
c) Regular Hypothesis c) A false positive hypothesis
d) Irregular Hypothesis d) A specialized hypothesis

Answer: a Answer: c
Explanation: Inductive learning Explanation: Consistent hypothesis go
involves finding a consistent with examples, If the hypothesis says
hypothesis that agrees with it should be negative but infect it is
examples. The difficulty of the task positive, it is false negative. If a
depends on the chosen hypothesis says it should be positive,
representation. but in fact, it is negative, it is false
positive. In a specialized hypothesis
18. Computational learning theory
we need to have certain restrict or
analyzes the sample complexity and
special conditions.
computational complexity of
_ 20. Neural Networks are complex
a) Unsupervised Learning with many
b) Inductive learning parameters.
c) Forced based learning a) Linear Functions
d) Weak learning b) Nonlinear Functions
c) Discrete Functions
Answer: b
d) Exponential Functions
Explanation: Computational learning
theory analyzes the sample Answer: b
complexity and computational Explanation: Neural networks

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

parameters can be learned from Answer: a

noisy data and they have been used Explanation: Not all formal languages
for thousands of applications, so it are context-free.
varies from problem to problem and
23. Which of the following statement
thus use nonlinear functions.
is not true?
21. A perceptron is a a) The union and concatenation of
two context-free languages is
a) Feed-forward neural network context-free
b) Backpropagation algorithm b) The reverse of a context-free
c) Backtracking algorithm language is context-free, but the
d) Feed Forward-backward algorithm complement need not be
c) Every regular language is context-
Answer: a
free because it can be described by a
Explanation: A perceptron is a Feed-
regular grammar
forward neural network with no
d) The intersection two context-free
hidden units that can be representing
languages is context-free
only linear separable functions. If the
data are linearly separable, a simple Answer: d
weight updated rule can be used to Explanation: The union and
fit the data exactly. concatenation of two context-free
languages are context-free; but
22. Which of the following statement
intersection need not be.
is true?
a) Not all formal languages are 24. A semantic network is used when
context-free one has knowledge that is best
b) All formal languages are Context understood as a set of concepts that
free are related to one another.
c) All formal languages are like a) True
natural language b) False
d) Natural languages are context-
Answer: a
oriented free
Explanation: None.

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

25. What are the limitations of the c) A is a kind of B

semantic networks? d) A is superordinate of B
a) Intractability
Answer: b
b) Lack in expressing some of the
Explanation: None.
properties
c) Incomplete 29. What is Antonymy relation?
d) Has memory constraints a) A is part of B
b) B has A as a part of itself
Answer: b
c) A denotes opposite of B
Explanation: None.
d) A is superordinate of B
26. What among the following is/are
Answer: c
the best example of semantic
Explanation: None.
networks?
a) Wordnet 30. Most semantic networks are not
b) Human Food Chain cognitive based.
c) MYSIN a) True
d) Autonomous car driver b) False

Answer: a Answer: b
Explanation: Wordnet is a lexical Explanation: None.
database of English.
31. In LISP, the function returns the
27. Semantic Network is also known list that results after the first element
as Frame networks. is removed (the rest f the list), is
a) True _
b) False a) car
b) last
Answer: a
c) cons
Explanation: None.
d) cdr
28. What is Synonymy relation?
Answer: d
a) A is part of B
Explanation: None.
b) A denotes same as B

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

32. Which of the following contains a) SHRDLU

the output segments of Artificial b) SIMD
Intelligence programming? c) BACON
a) Printed language and synthesized d) STUDENT
speech
Answer: a
b) Manipulation of physical object
Explanation: None.
c) Locomotion
d) All of the mentioned 36. MLMenu, a natural language
interface for the TI Explorer, is similar
Answer: d
to
Explanation: None.
a) Ethernet
33. LISP was created by? b) NaturalLink
a) John McCarthy c) PROLOG
b) Marvin Minsky d) The Personal Consultant
c) Alan Turing
Answer: b
d) Allen Newell and Herbert Simon
Explanation: None.
Answer: a
37. Strong Artificial Intelligence is
Explanation: None.
_
34. Expert Ease was developed under a) the embodiment of human
the direction of _ intellectual capabilities within a
a) John McCarthy computer
b) Donald Michie b) a set of computer programs that
c) Lofti Zadeh produce output that would be
d) Alan Turing considered to reflect intelligence if it
were generated by humans
Answer: b
c) the study of mental faculties
Explanation: None.
through the use of mental models
35. An Artificial Intelligence system implemented on a computer
developed by Terry A. Winograd to d) all of the mentioned
permit an interactive dialogue about
Answer: a
a domain he called blocks-world.
Explanation: None.

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

38. The traditional way to exit and the system or machine will act as per
LISP system is to enter _ the requirement.
a) quit
41. The performance of an agent can
b) exit
be improved by _
c) bye
a) Learning
d) ok
b) Observing
Answer: b c) Perceiving
Explanation: None. d) None of the mentioned

39. In which of the following Answer: a

situations might a blind search be Explanation: An agent can improve by
acceptable? saving the previous states on which it
a) real-life situation was earlier, hence in future it can
b) complex game learn to respond in the same
c) small search space situation better.
d) all of the mentioned
42. External actions of the agent is
Answer: c selected by
Explanation: None. a) Perceive
b) Performance
40. What is Artificial intelligence?
c) Learning
a) Putting your intelligence into
d) Actuator
Computer
b) Programming with your own Answer: b
intelligence Explanation: It depends on how you
c) Making a Machine intelligent want to improve and what the
d) Playing a Game performance measures are.

Answer: c 43. The action of the Simple reflex

Explanation: Because AI is to make agent completely depends upon
things work automatically through _
machine without using human effort. a) Perception history
Machine will give the result with just b) Current perception
giving input from human. That means

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

c) Learning theory theories about how the human mind

d) Utility functions works.

Answer: b 45. An Artificial Neural Network Is

Explanation: These agents select based on?
actions based on the current a) Strong Artificial Intelligence
perception, ignoring the rest of the approach
perception history. b) Weak Artificial Intelligence
approach
44. Which of the following could be
c) Cognitive Artificial Intelligence
the approaches to Artificial
approach
Intelligence?
d) Applied Artificial Intelligence
a) Strong Artificial Intelligence
approach
b) Weak Artificial Intelligence
c) Applied Artificial Intelligence Answer: c
d) All of the mentioned Explanation: In the Cognitive Artificial
Intelligence approach, a computer is
Answer: d
used to test theories about how the
Explanation: Strong Artificial
human mind works, for example,
Intelligence aims to build machines
theories about how we recognize
that can truly reason and solve
faces and other objects, or about
problems.
how we solve abstract problems.
Weak Artificial Intelligence deals with
the creation of some form of 46. The Face Recognition system is
computer-based artificial intelligence based on?
that cannot truly reason and solve a) Strong Artificial Intelligence
problems, but can act as if it were approach
intelligent. b) Weak Artificial Intelligence
Applied Artificial Intelligence aims to approach
produce commercially viable “smart” c) Cognitive Artificial Intelligence
systems. approach
In the Cognitive Artificial Intelligence d) Applied Artificial Intelligence
approach, a computer is used to test approach

10

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: d Intelligence maintains that suitably

Explanation: Applied Artificial programmed machines are capable of
Intelligence approach aims to cognitive mental states.
produce commercially viable “smart”
48. A basic line following robot is
systems such as, for example, a
based on
security system that is able to
a) Strong Artificial Intelligence
recognize the faces of people who
approach
permitted to enter a particular
b) Weak Artificial Intelligence
building. Applied Artificial Intelligence
approach
has already enjoyed considerable
c) Cognitive Artificial Intelligence
success.
approach
47. A completely automated chess d) Applied Artificial Intelligence
engine (Learn from previous games) approach
is based on?
Answer: b
a) Strong Artificial Intelligence
Explanation: Weak Artificial
approach
Intelligence deals with the creation of
b) Weak Artificial Intelligence
some form of computer-based
approach
artificial intelligence that cannot truly
c) Cognitive Artificial Intelligence
reason and solve problems, but can
approach
act as if it were intelligent. Weak
d) Applied Artificial Intelligence
Artificial Intelligence holds that
approach
suitably programmed machines can
Answer: a simulate human cognition.
Explanation: Strong Artificial
49. Which of the following task/tasks
Intelligence aims to build machines
Artificial Intelligence could not do
that can truly reason and solve
yet?
problems. These machines must be
a) Understand natural language
self-aware and their overall
robustly
intellectual ability needs to be
b) Web mining
indistinguishable from that of a
c) Construction of plans in real time
human being. Strong Artificial

11

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

dynamic systems a) Codes

d) All of the mentioned b) Phonemes
c) Samples
Answer: d
d) Words
Explanation: These are the areas in
which need more focus for Answer: c
improvements. Explanation: None.

50. What among the following is/are 52. Which term is used for describing
the example of the intelligent the judgmental or commonsense part
agent/agents? of problem solving?
a) Human a) Heuristic
b) Robot b) Critical
c) Autonomous Spacecraft c) Value based
d) All of the mentioned d) Analytical

Answer: d Answer: a
Explanation: Humans can be looked Explanation: None.
upon as agents. They have eyes, ears,
53. Which stage of the manufacturing
skin, taste buds, etc. for sensors; and
process has been described as “the
hands, fingers, legs, mouth for
mapping of function onto form”?
effectors. Robots are agents. Robots
a) Design
may have camera, sonar, infrared,
b) Distribution
bumper, etc. for sensors. They can
c) Project management
have grippers, wheels, lights,
d) Field service
speakers, etc. for actuators.
Autonomous Spacecraft takes Answer: a
decision on its own based on Explanation: None.
perceptions.
54. Which kind of planning consists of
51. When talking to a speech successive representations of
recognition program, the program different levels of a plan?
divides each second of your speech a) hierarchical planning
into 100 separate b) non-hierarchical planning

12

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

c) project planning a) Alain Colmerauer

d) all of the mentioned b) Niklaus Wirth
c) Seymour Papert
Answer: a
d) John McCarthy
Explanation: None.
Answer: a
55. What was originally called the
Explanation: None.
“imitation game” by its creator?
a) The Turing Test 58. Programming a robot by
b) LISP physically moving it through the
c) The Logic Theorist trajectory you want it to follow be
d) Cybernetics called
a) contact sensing control
Answer: a
b) continuous-path control
Explanation: None.
c) robot vision control
56. Decision support programs are d) pick-and-place control
designed to help managers make
Answer: b
_
Explanation: None.
a) budget projections
b) visual presentations 59. To invoke the LISP system, you
c) business decisions must enter _
d) vacation schedules a) AI
b) LISP
Answer: c
c) CL (Common Lisp)
Explanation: None.
d) Both LISP and CL
57. PROLOG is an AI programming
Answer: b
language, which solves problems with
Explanation: None.
a form of symbolic logic known as
predicate calculus. It was developed 60. In LISP, what is the function (list-
in 1972 at the University of Marseilles length <list>)?
by a team of specialists. Can you a) returns a new list that is equal to
name the person who headed this &lt:list> by copying the top-level
team? element of <list>

13

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

b) returns the length of <list> Answer: a

c) returns t if <list> is empty Explanation: None.
d) all of the mentioned
64. A mouse device may be
Answer: b _
Explanation: None. a) electro-chemical
b) mechanical
61. What is the primary interactive
c) optical
method of communication used by
d) both mechanical and optical
humans?
a) reading Answer: d
b) writing Explanation: None.
c) speaking
65. An expert system differs from a
d) all of the mentioned
database program in that only an
Answer: c expert system
Explanation: None. a) contains declarative knowledge
b) contains procedural knowledge
62. Elementary linguistic units that
c) features the retrieval of stored
are smaller than words are?
information
a) allophones
d) expects users to draw their own
b) phonemes
conclusions
c) syllables
d) all of the mentioned Answer: b
Explanation: None.
Answer: d
Explanation: None. 66. Arthur Samuel is linked
inextricably with a program that
63. In LISP, the atom that stands for
played
“true” is
a) checkers
a) t
b) chess
b) ml
c) cricket
c) y
d) football
d) time

14

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: a Answer: c
Explanation: None. Explanation: As the search explore
only linear sequences of actions, So
67. Natural language understanding is
they cannot take advantage of
used in
problem decomposition.
a) natural language interfaces
b) natural language front ends 70. What is the advantage of totally
c) text understanding systems ordered plan in constructing the
d) all of the mentioned plan?
a) Reliability
Answer: d
b) Flexibility
Explanation: None.
c) Easy to use
68. Which of the following search d) All of the mentioned
belongs to totally ordered plan
Answer: b
search?
Explanation: Totally ordered plan has
a) Forward state-space search
the advantage of flexibility in the
b) Hill-climbing search
order in which it constructs the plan.
c) Depth-first search
d) Breadth-first search 71. Which strategy is used for
delaying a choice during search?
Answer: a
a) First commitment
Explanation: Forward and backward
b) Least commitment
state-space search are particular
c) Both First & Least commitment
forms of totally ordered plan search.
d) None of the mentioned
69. Which cannot be taken as
Answer: b
advantage for totally ordered plan
Explanation: The general strategy of
search?
delaying a choice during search is
a) Composition
called the least commitment strategy.
b) State search
c) Problem decomposition 72. Which algorithm places two
d) None of the mentioned actions into a plan without specifying
which should come first?
a) Full-order planner

15

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

b) Total-order planner 75. What are present in the empty

c) Semi-order planner plan?
d) Partial-order planner a) Start
b) Finish
Answer: d
c) Modest
Explanation: Any planning algorithm
d) Both Start & Finish
that can place two actions into a plan
without specifying which should Answer: d
come first is called partial-order Explanation: The ‟empty‟ plan
planner. contains just the start and finish
actions.
73. How many possible plans are
available in partial-order solution? 76. What are not present in start
a) 3 actions?
b) 4 a) Preconditions
c) 5 b) Effect
d) 6 c) Finish
d) None of the mentioned
Answer: d
Explanation: The partial-order Answer: a
solution corresponds to six possible Explanation: Start has no
total-order plans. precondition and has as its effects all
the literals in the initial state of the
74. What is the other name of each
planning problem.
and every total-order plans?
a) Polarization 77. What are not present in finish
b) Linearization actions?
c) Solarization a) Preconditions
d) None of the mentioned b) Effect
c) Finish
Answer: b
d) None of the mentioned
Explanation: Each and every total
order plan is also called as Answer: b
linearization of the partial-order plan. Explanation: Finish has no effects and

16

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

has as its preconditions the goal Answer: d

literals of the planning algorithm. Explanation: None.

78. Which can be adapted for 81. The Personal Consultant is based
planning algorithms? on?
a) Most-constrained variable a) EMYCIN
b) Most-constrained literal b) OPS5+
c) Constrained c) XCON
d) None of the mentioned d) All of the mentioned

Answer: a Answer: d
Explanation: The most-constrained Explanation: None.
variable heuristic from CSPs can be
82. What is Machine learning?
adapted for planning algorithm and
a) The autonomous acquisition of
seems to work well.
knowledge through the use of
79. Which of the following are computer programs
examples of software development b) The autonomous acquisition of
tools? knowledge through the use of
a) debuggers manual programs
b) editors c) The selective acquisition of
c) assemblers, compilers and knowledge through the use of
interpreters computer programs
d) all of the mentioned d) The selective acquisition of
knowledge through the use of
Answer: d
manual programs
Explanation: None.
Answer: a
80. Which is the first AI programming
Explanation: Machine learning is the
language?
autonomous acquisition of
a) BASIC
knowledge through the use of
b) FORTRAN
computer programs.
c) IPL(Inductive logic programming)
d) LISP 83. Which of the factors affect the
performance of learner system does

17

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

not include? knowledge that does not include

a) Representation scheme used empirical knowledge.
b) Training scenario
86. A model of language consists of
c) Type of feedback
the categories which does not
d) Good data structures
include?
Answer: d a) Language units
Explanation: Factors that affect the b) Role structure of units
performance of learner system does c) System constraints
not include good data structures. d) Structural units

84. Different learning methods does Answer: d

not include? Explanation: A model of language
a) Memorization consists of the categories which does
b) Analogy not include structural units.
c) Deduction
87. What is a top-down parser?
d) Introduction
a) Begins by hypothesizing a sentence
Answer: d (the symbol S) and successively
Explanation: Different learning predicting lower level constituents
methods does not include the until individual preterminal symbols
introduction. are written
b) Begins by hypothesizing a sentence
85. In language understanding, the
(the symbol S) and successively
levels of knowledge that does not
predicting upper level constituents
include?
until individual preterminal symbols
a) Phonological
are written
b) Syntactic
c) Begins by hypothesizing lower level
c) Empirical
constituents and successively
d) Logical
predicting a sentence (the symbol S)
Answer: c d) Begins by hypothesizing upper
Explanation: In language level constituents and successively
understanding, the levels of predicting a sentence (the symbol S)

18

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: a 90. Which instruments are used for

Explanation: A top-down parser perceiving and acting upon the
begins by hypothesizing a sentence environment?
(the symbol S) and successively a) Sensors and Actuators
predicting lower level constituents b) Sensors
until individual preterminal symbols c) Perceiver
are written. d) None of the mentioned

88. Among the following which is not Answer: a

a horn clause? Explanation: An agent is anything that
a) p can be viewed as perceiving and
b) Øp V q acting upon the environment through
c) p → q the sensors and actuators.
d) p → Øq
91. What is meant by agent‟s percept
Answer: d sequence?
Explanation: p → Øq is not a horn a) Used to perceive the environment
clause. b) Complete history of actuator
c) Complete history of perceived
89. The action „STACK(A, B)‟ of a
things
robot arm specify to
d) None of the mentioned

a) Place block B on Block A Answer: c

b) Place blocks A, B on the table in Explanation: An agent‟s percept
that order sequence is the complete history of
c) Place blocks B, A on the table in everything that the agent has ever
that order perceived.
d) Place block A on block B
92. How many types of agents are
Answer: d there in artificial intelligence?
Explanation: The action „STACK(A,B)‟ a) 1
of a robot arm specify to Place block b) 2
A on block B. c) 3
d) 4

19

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: d Answer: a
Explanation: The four types of agents Explanation: Problem generator will
are Simple reflex, Model based, Goal give the suggestion to improve the
based and Utility based agents. output for learning agent.

93. What is the rule of simple reflex 96. Which is used to improve the
agent? agents performance?
a) Simple-action rule a) Perceiving
b) Condition-action rule b) Learning
c) Simple & Condition-action rule c) Observing
d) None of the mentioned d) None of the mentioned

Answer: b Answer: b
Explanation: Simple reflex agent is Explanation: An agent can improve its
based on the present condition and performance by storing its previous
so it is condition action rule. actions.

94. What are the composition for 97. Which agent deals with happy
agents in artificial intelligence? and unhappy states?
a) Program a) Simple reflex agent
b) Architecture b) Model based agent
c) Both Program & Architecture c) Learning agent
d) None of the mentioned d) Utility based agent

Answer: c Answer: d
Explanation: An agent program will Explanation: A utility function maps a
implement function mapping state onto a real number which
percepts to actions. describes the associated degree of
happiness.
95. In which agent does the problem
generator is present? 98. In hopfield network with
a) Learning agent symmetric weights, energy at each
b) Observing agent state may?
c) Reflex agent a) increase
d) None of the mentioned b) decrease

20

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

c) decrease or remain same c) not possible

d) decrease or increase d) none of the mentioned

Answer: c Answer: b
Explanation: Energy of the network Explanation: Error in recall due to
cant increase as it may then lead to false minima can be reduced by
instability. stochastic update for states.

99. In hopfield model with symmetric 102. Energy at each state in hopfield
weights, network can move to? with symmetric weights network may
a) lower increase or decrease?
b) higher a) yes
c) lower or higher b) no
d) lower or same
Answer: b
Answer: d Explanation: Energy of the network
Explanation: In hopfield model with cant increase as it may then lead to
symmetric weights, network can instability.
move to lower or same state.
103. Pattern storage problem which
100. Can error in recall due to false cannot be represented by a feedback
minima be reduced? network of given size can be called
a) yes as?
b) no a) easy problems
b) hard problems
Answer: a
c) no such problem exist
Explanation: There are generally two
d) none of the mentioned
methods to reduce error in recall due
to false minima. Answer: b
Explanation: Pattern storage problem
101. How can error in recall due to
which cannot be represented by a
false minima be reduced?
feedback network of given size are
a) deterministic update for states
known as hard problems.
b) stochastic update for states

21

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

104. What is the other way to reduce c) no change

error in recall due to false minima d) none of the mentioned
apart from stochastic update?
Answer: c
a) no other method exist
Explanation: Temperature doesn‟t
b) by storing desired patterns at
effect stochastic update.
lowest energy minima
c) by storing desired patterns at 107. Why does change in
energy maxima temperature doesn‟t effect stochastic
d) none of the mentioned update?
a) shape landscape depends on the
Answer: b
network and its weights which varies
Explanation: Error in recall due to
accordingly and compensates the
false minima can be reduced by
effect
stochastic update or by storing
b) shape landscape depends on the
desired patterns at lowest energy
network and its weights which is
minima.
fixed
105. How can error in recall due to c) shape landscape depends on the
false minima be further reduced? network, its weights and the output
a) using suitable activation dynamics function which varies accordingly and
b) cannot be further reduced compensates the effect
c) by storing desired patterns at d) shape landscape depends on the
energy maxima network, its weights and the output
d) none of the mentioned function which is fixed

Answer: a Answer: d
Explanation: Error in recall due to Explanation: Change in temperature
false minima can further be reduced doesn‟t effect stochastic update
by using suitable activation dynamics. because shape landscape depends on
the network, its weights and the
106. As temperature increase, what
output function which is fixed.
happens to stochastic update?
a) increase in update 108. Which action sequences are
b) decrease in update used to achieve the agent‟s goal?

22

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

a) Search processing.
b) Plan a) True
c) Retrieve b) False
d) Both Search & Plan
Answer: a
Answer: d Explanation: Natural Language
Explanation: When the environment Generation is to Convert information
becomes more tricky means, the from computer databases into
agent needs plan and search action readable human language.
sequence to achieve the goal.
112. OCR (Optical Character
109. Which element in the agent are Recognition) uses NLP.
used for selecting external actions? a) True
a) Perceive b) False
b) Performance
Answer: a
c) Learning
Explanation: Given an image
d) Actuator
representing printed text, determines
Answer: b the corresponding text.
Explanation: None.
113. Parts-of-Speech tagging
110. Given a stream of text, Named determines
Entity Recognition determines which a) part-of-speech for each word
pronoun maps to which noun. dynamically as per meaning of the
a) False sentence
b) True b) part-of-speech for each word
dynamically as per sentence structure
Answer: a
c) all part-of-speech for a specific
Explanation: Given a stream of text,
word given as input
Named Entity Recognition
d) all of the mentioned
determines which items in the text
maps to proper names. Answer: d
Explanation: A Bayesian network
111. Natural Language generation is
provides a complete description of
the main task of Natural language
the domain.

23

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

114. Parsing determines Parse Trees c) Xerox

(Grammatical Analysis) for a given d) Texas Instruments
sentence.
Answer: b
a) True
Explanation: None.
b) False
117. What of the following is
Answer: a
considered a pivotal event in the
Explanation: Determine the parse
history of Artificial Intelligence?
tree (grammatical analysis) of a given
a) 1949, Donald O, The organization
sentence. The grammar for natural
of Behavior
languages is ambiguous and typical
b) 1950, Computing Machinery and
sentences have multiple possible
Intelligence
analyses. In fact, perhaps surprisingly,
c) 1956, Dartmouth University
for a typical sentence there may be
Conference Organized by John
thousands of potential parses (most
McCarthy
of which will seem completely
d) 1961, Computer and Computer
nonsensical to a human).
Sense
115. Ambiguity may be caused by
Answer: c
Explanation: None.
a) syntactic ambiguity
b) multiple word meanings 118. What are the two subfields of
c) unclear antecedents Natural language processing?
d) all of the mentioned a) symbolic and numeric
b) time and motion
Answer: d
c) algorithmic and heuristic
Explanation: None.
d) understanding and generation
116. Which company offers the LISP
Answer: c
machine considered “the most
Explanation: None.
powerful symbolic processor
available”? 119. High-resolution, bit-mapped
a) LMI displays are useful for displaying
b) Symbolics _

24

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

a) clearer characters c) add

b) graphics d) eva
c) more characters
Answer: a
d) all of the mentioned
Explanation: None.
Answer: c
123. Which type of actuator
Explanation: None.
generates a good deal of power but
120. A bidirectional feedback loop tends to be messy?
links computer modeling with a) electric
_ b) hydraulic
a) artificial science c) pneumatic
b) heuristic processing d) both hydraulic & pneumatic
c) human intelligence
Answer: b
d) cognitive science
Explanation: None.
Answer: c
124. Research scientists all over the
Explanation: None.
world are taking steps towards
121. Which of the following have building computers with circuits
people traditionally done better than patterned after the complex
computers? interconnections existing among the
a) recognizing relative importance human brain‟s nerve cells. What
b) finding similarities name is given to such type of
c) resolving ambiguity computers?
d) all of the mentioned a) Intelligent computers
b) Supercomputers
Answer: c
c) Neural network computers
Explanation: None.
d) Smart computers
122. In LISP, the function evaluates
Answer: c
both and is
Explanation: None.
a) set
b) setq 125. The integrated circuit was
invented by Jack Kilby of

25

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

_ same thing.
a) MIT a) True
b) Texas Instruments b) False
c) Xerox
Answer: b
d) All of the mentioned
Explanation: Information retrieval (IR)
Answer: b – This is concerned with storing,
Explanation: None. searching and retrieving information.
It is a separate field within computer
126. The Cedar, BBN Butterfly,
science (closer to databases), but IR
Cosmic Cube and Hypercube machine
relies on some NLP methods (for
can be characterized as
example, stemming). Some current
_
research and applications seek to
a) SISD
bridge the gap between IR and NLP.
b) MIMD
Information extraction (IE) – This is
c) SIMD
concerned in general with the
d) MISD
extraction of semantic information
Answer: b from text. This covers tasks such as
Explanation: None. named entity recognition,
Coreference resolution, relationship
127. A series of AI systems,
extraction, etc.
developed by Pat Langley to explore
the role of heuristics in scientific 129. Many words have more than
discovery is one meaning; we have to select the
a) RAMD meaning which makes the most sense
b) BACON in context. This can be resolved by
c) MIT
d) DU a) Fuzzy Logic
b) Word Sense Disambiguation
Answer: b c) Shallow Semantic Analysis
Explanation: None. d) All of the mentioned
128. IR (information Retrieval) and IE Answer: b
(Information Extraction) are the two
Explanation: Shallow Semantic

26

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Analysis doesn‟t cover word sense 132. Which depends on the percepts
disambiguation. and actions available to the agent?
a) Agent
129. Given a sound clip of a person or
b) Sensor
people speaking, determine the
c) Design problem
textual representation of the speech.
d) None of the mentioned
a) Text-to-speech
b) Speech-to-text Answer: c
c) All of the mentioned Explanation: The design problem
d) None of the mentioned depends on the percepts and actions
available to the agent, the goals that
Answer: b
the agent‟s behavior should satisfy.
Explanation: NLP is required to
linguistic analysis. 133. Which were built in such a way
that humans had to supply the inputs
130. Speech Segmentation is a
and interpret the outputs?
subtask of Speech Recognition.
a) Agents
a) True
b) AI system
b) False
c) Sensor
Answer: a d) Actuators
Explanation: None.
Answer: b
131. In linguistic morphology Explanation: AI systems were built in
_ is the process for such a way that humans had to
reducing inflected words to their root supply the inputs and interpret the
form. outputs.
a) Rooting
134. Which technology uses
b) Stemming
miniaturized accelerometers and
c) Text-Proofing
gyroscopes?
d) Both Rooting & Stemming
a) Sensors
Answer: b b) Actuators
Explanation: None. c) MEMS
d) None of the mentioned

27

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: c b) Hearing
Explanation: Micro ElectroMechanical c) Perceiving
System uses miniaturized d) Speech
accelerometers and gyroscopes and
Answer: a
is used to produce actuators.
Explanation: Learning will take place
135. What is used for tracking as the agent observes its interactions
uncertain events? with the world and its own decision
a) Filtering algorithm making process.
b) Sensors
138. Which modifies the performance
c) Actuators
element so that it makes better
d) None of the mentioned
decision?
Answer: a a) Performance element
Explanation: Filtering algorithm is b) Changing element
used for tracking uncertain events c) Learning element
because in this the real perception is d) None of the mentioned
involved.
Answer: c
136. What is not represented by Explanation: A learning element
using propositional logic? modifies the performance element so
a) Objects that it can make better decision.
b) Relations
139. How many things are concerned
c) Both Objects & Relations
in the design of a learning element?
d) None of the mentioned
a) 1
Answer: c b) 2
Explanation: Objects and relations c) 3
are not represented by using d) 4
propositional logic explicitly.
Answer: c
137. What will take place as the Explanation: The three main issues
agent observes its interactions with are affected in design of a learning
the world? element are components, feedback
a) Learning and representation.

28

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

140. What is used in determining the element in the game playing

nature of the learning problem? programs.
a) Environment
143. Which is used to choose among
b) Feedback
multiple consistent hypotheses?
c) Problem
a) Razor
d) All of the mentioned
b) Ockham razor
Answer: b c) Learning element
Explanation: The type of feedback is d) None of the mentioned
used in determining the nature of the
Answer: b
learning problem that the agent
Explanation: Ockham razor prefers
faces.
the simplest hypothesis consistent
141. How many types are available in with the data intuitively.
machine learning?
144. What will happen if the
a) 1
hypothesis space contains the true
b) 2
function?
c) 3
a) Realizable
d) 4
b) Unrealizable
Answer: c c) Both Realizable & Unrealizable
Explanation: The three types of d) None of the mentioned
machine learning are supervised,
Answer: b
unsupervised and reinforcement.
Explanation: A learning problem is
142. Which is used for utility realizable if the hypothesis space
functions in game playing algorithm? contains the true function.
a) Linear polynomial
145. What takes input as an object
b) Weighted polynomial
described by a set of attributes?
c) Polynomial
a) Tree
d) Linear weighted polynomial
b) Graph
Answer: d c) Decision graph
Explanation: Linear weighted d) Decision tree
polynomial is used for learning

29

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: d c) Relational
Explanation: Decision tree takes input d) All of the mentioned
as an object described by a set of
Answer: d
attributes and returns a decision.
Explanation: Because an agent may
146. How the decision tree reaches experience any kind of situation, So
its decision? that an agent should use all kinds of
a) Single test architecture.
b) Two test
149. Specify the agent architecture
c) Sequence of test
name that is used to capture all kinds
d) No test
of actions.
Answer: c a) Complex
Explanation: A decision tree reaches b) Relational
its decision by performing a sequence c) Hybrid
of tests. d) None of the mentioned

147. Which functions are used as Answer: c

preferences over state history? Explanation: A complete agent must
a) Award be able to do anything by using
b) Reward hybrid architecture.
c) Explicit
150. Which agent enables the
d) Implicit
deliberation about the computational
Answer: b entities and actions?
Explanation: Reward functions may a) Hybrid
be that preferences over states are b) Reflective
really compared from preferences c) Relational
over state histories. d) None of the mentioned

148. Which kind of agent architecture Answer: b

should an agent an use? Explanation: Because it enables the
a) Relaxed agent to capture within itself.
b) Logic

30

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

151. What can operate over the joint d) Representing your problem with
state space? variable and parameter
a) Decision-making algorithm
Answer: d
b) Learning algorithm
Explanation: Because state space is
c) Complex algorithm
mostly concerned with a problem,
d) Both Decision-making & Learning
when you try to solve a problem, we
algorithm
have to design a mathematical
Answer: d structure to the problem, which can
Explanation: Decision-making and only be through variables and
learning algorithms can operate over parameters. eg. You have given a 4-
the joint state space and thereby gallon jug and another 3-gallon jug.
serve to implement and used to Neither has measuring marker on it.
improve the computational activities. You have to fill the jugs with water.
How can you get exactly 2 gallons of
152. What is the main task of a
water in to 4 gallons. Here the state
problem-solving agent?
space can defined as set of ordered
a) Solve the given problem and reach
pairs integers(x,y), such that x=0,1,2,3
to goal
or 4 and y=0,1,2 or 3; X represents
b) To find out which sequence of
the number of gallons in 4 gallon jug
action will get it to the goal state
and y represents the quantity of
c) All of the mentioned
water in the 3-gallon jug.
d) None of the mentioned
154. The problem-solving agent with
Answer: c
several immediate options of
Explanation: The problem-solving
unknown value can decide what to
agents are one of the goal-based
do by just examining different
agents.
possible sequences of actions that
153. What is state space? lead to states of known value, and
a) The whole problem then choosing the best sequence.
b) Your Definition to a problem This process of looking for such a
c) Problem you design sequence is called Search.

31

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

a) True a) Intermediate states

b) False b) Initial state
c) Successor function, which takes
Answer: a
current action and returns next
Explanation: Refer to the definition of
immediate state
problem-solving agent.
d) None of the mentioned
155. A search algorithm takes
Answer: c
as an input and returns
Explanation: The most common
as an output.
formulation for actions uses a
a) Input, output
successor function. Given a particular
b) Problem, solution
state x, SUCCESSOR-FN(x) returns a
c) Solution, problem
set of (action, successor) ordered
d) Parameters, sequence of actions
pairs, where each action is one of the
Answer: b legal actions in state x and each
Explanation: A search algorithm takes successor is a state that can be
input as a problem and returns a reached from x by applying the
solution to the problem as an output. action.

156. A problem in a search space is 158. A solution to a problem is a path

defined by one of these state. from the initial state to a goal state.
a) Initial state Solution quality is measured by the
b) Last state path cost function, and an optimal
c) Intermediate state solution has the highest path cost
d) All of the mentioned among all solutions.
a) True
Answer: a
b) False
Explanation: A problem has four
Answer: a
components initial state, goal test,
Explanation: A solution to a problem
set of actions, path cost.
is a path from the initial state to a
157. The Set of actions for a problem goal state. Solution quality is
in a state space is formulated by a measured by the path cost function,

32

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

and an optimal solution has the b) Travelling Salesman problem

lowest path cost among all solutions. c) Map coloring problem
d) Depth first search traversal on a
159. The process of removing detail
given map represented as a graph
from a given state representation is
called _ Answer: b
a) Extraction Explanation: Refer the TSP problem.
b) Abstraction
162. Web Crawler is a/an
c) Information Retrieval
d) Mining of data
a) Intelligent goal-based agent
Answer: b b) Problem-solving agent
Explanation: The process of removing c) Simple reflex agent
detail from a representation is called d) Model based agent
abstraction.
Answer: a
160. A problem solving approach Explanation: Web Crawling is type of
works well for search for a relevant document from
a) 8-Puzzle problem given seed documents. Focused
b) 8-queen problem crawlers exists, helps to improvise
c) Finding a optimal path from a given the search efficiency.
source to a destination
163. What is the major
d) Mars Hover (Robot Navigation)
component/components for
Answer: d measuring the performance of
Explanation: Problem-solving problem solving?
approach works well for toy problems a) Completeness
and real-world problems. b) Optimality
c) Time and Space complexity
161. The _ is a touring
d) All of the mentioned
problem in which each city must be
visited exactly once. The aim is to find Answer: d
the shortest tour. Explanation: For best performance
a) Finding shortest path between a consideration of all component is
source and a destination necessary.

33

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

164. A production rule consists of c) Random approach

d) An Optimal approach
a) A set of Rule
Answer: b
b) A sequence of steps
Explanation: We use a Heuristic
c) Set of Rule & sequence of steps
approach, as it will find out brute
d) Arbitrary representation to
force computation, looking at
problem
hundreds of thousands of positions.
Answer: c e) g Chess competition
Explanation: When you are trying to between Human and AI based
solve a problem, you should design Computer.
how to get a step-by-step solution
167. General games involves
with constraints condition to your
problem, e.g Chess board problem.
a) Single-agent
165. Which search method takes less b) Multi-agent
memory? c) Neither Single-agent nor Multi-
a) Depth-First Search agent
b) Breadth-First search d) Only Single-agent and Multi-agent
c) Linear Search
Answer: d
d) Optimal search
Explanation: Depending upon games
Answer: a it could be single agent (Sudoku) or
Explanation: Depth-First Search takes multi-agent (Chess).
less memory since only the nodes on
168. Adversarial search problems
the current path are stored, but in
uses _
Breadth First Search, all of the tree
a) Competitive Environment
that has generated must be stored.
b) Cooperative Environment
166. Which is the best way to go for c) Neither Competitive nor
Game playing problem? Cooperative Environment
a) Linear approach d) Only Competitive and Cooperative
b) Heuristic approach (Some Environment
knowledge is stored)
Answer: a

34

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Explanation: Since in cooperative

35

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

environment agents‟ goals are I Answer: c

conflicts. They compete for goal. Explanation: Zero sum games could
be multiplayer games as long as the
169. Mathematical game theory, a
condition for zero sum game is
branch of economics, views any
satisfied.
multi-agent environment as a game
provided that the impact of each 172. A game can be formally defined
agent on the others is “significant,” as a kind of search problem with the
regardless of whether the agents are following components.
cooperative or competitive. a) Initial State
a) True b) Successor Function
b) False c) Terminal Test
d) All of the mentioned
Answer: a
Explanation: None. Answer: d
Explanation: The initial state includes
170. Zero sum games are the one in
the board position and identifies the
which there are two agents whose
player to move. A successor function
actions must alternate and in which
returns a list of (move, state) pairs,
the utility values at the end of the
each indicating a legal move and the
game are always the same.
resulting state. A terminal test
a) True
determines when the game is over.
b) False
States where the game has ended are
Answer: b called terminal states. A utility
Explanation: Utility values are always function (also called an objective
same and opposite. function or payoff function), which
gives a numeric value for the terminal
171. Zero sum game has to be a
states. In chess, the outcome is a win,
game.
lose, or draw, with values +1, -1, or 0.
a) Single player
b) Two player 173. The initial state and the legal
c) Multiplayer moves for each side define the
d) Three player _ for the game.
a) Search Tree

36

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

b) Game Tree 175. The minimax algorithm

c) State Space Search computes the minimax decision from
d) Forest the current state. It uses a simple
recursive computation of the
Answer: b
minimax values of each successor
Explanation: An example of game
state, directly implementing the
tree for Tic-Tac-Toe game.
defining equations. The recursion
174. General algorithm applied on proceeds all the way down to the
game tree for making decision of leaves of the tree, and then the
win/lose is minimax values are backed up
a) DFS/BFS Search Algorithms through the tree as the recursion
b) Heuristic Search Algorithms unwinds.
c) Greedy Search Algorithms a) True
d) MIN/MAX Algorithms b) False

Answer: d Answer: a
Explanation: Given a game tree, the Explanation: Refer definition of
optimal strategy can be determined minimax algorithm.
by examining the min/max value of
176. What is the complexity of
each node, which we write as
minimax algorithm?
MINIMAX- VALUE(n). The min/max
a) Same as of DFS
value of a node is the utility (for
b) Space – bm and time – bm
MAX) of being in the corresponding
c) Time – bm and space – bm
state, assuming that both players play
d) Same as BFS
optimally from there to the end of
the game. Obviously, the min/max Answer: a
value of a terminal state is just its Explanation: Same as DFS.
utility. Furthermore, given a choice,
177. Which is the most
MAX will prefer to move to a state of
straightforward approach for
maximum value, whereas MIN
planning algorithm?
prefers a state of minimum value.
a) Best-first search
b) State-space search

37

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

c) Depth-first search 180. What is the other name for

d) Hill-climbing search forward state-space search?
a) Progression planning
Answer: b
b) Regression planning
Explanation: The straightforward
c) Test planning
approach for planning algorithm is
d) None of the mentioned
state space search because it takes
into account of everything for finding Answer: a
a solution. Explanation: It is sometimes called as
progression planning, because it
178. What are taken into account of
moves in the forward direction.
state-space search?
a) Postconditions 181. How many states are available in
b) Preconditions state-space search?
c) Effects a) 1
d) Both Preconditions & Effects b) 2
c) 3
Answer: d
d) 4
Explanation: The state-space search
takes both precondition and effects Answer: d
into account for solving a problem. Explanation: There are four states
available in state-space search. They
179. How many ways are available to
are initial state, actions, goal test and
solve the state-space search?
step cost.
a) 1
b) 2 182. What is the main advantage of
c) 3 backward state-space search?
d) 4 a) Cost
b) Actions
Answer: b
c) Relevant actions
Explanation: There are two ways
d) All of the mentioned
available to solve the state-space
search. They are forward from the Answer: c
initial state and backward from the Explanation: The main advantage of
goal.

38

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

backward search will allow us to c) Compilation

consider only relevant actions. d) Termination

183. What is the other name of the Answer: d

backward state-space search? Explanation: None.
a) Regression planning
186. Which approach is to pretend
b) Progression planning
that a pure divide and conquer
c) State planning
algorithm will work?
d) Test planning
a) Goal independence
Answer: a b) Subgoal independence
Explanation: Backward state-space c) Both Goal & Subgoal independence
search will find the solution from goal d) None of the mentioned
to the action, So it is called as
Answer: b
Regression planning.
Explanation: Subgoal independence
184. What is meant by consistent in approach is to pretend that a pure
state-space search? divide and conquer algorithm will
a) Change in the desired literals work for admissible heuristics.
b) Not any change in the literals
187. Which search is equal to
c) No change in goal state
minimax search but eliminates the
d) None of the mentioned
branches that can‟t influence the final
Answer: b decision?
Explanation: Consistent means that a) Depth-first search
the completed actions will not undo b) Breadth-first search
any desired literals. c) Alpha-beta pruning
d) None of the mentioned
185. What will happen if a
predecessor description is generated Answer: c
that is satisfied by the initial state of Explanation: The alpha-beta search
the planning problem? computes the same optimal moves as
a) Success minimax, but eliminates the branches
b) Error that can‟t influence the final decision.

39

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

188. Which values are independant in depth-first search, So at one time we

minimax search algorithm? just have to consider the nodes along
a) Pruned leaves x and y a single path in the tree.
b) Every states are dependant
191. Which value is assigned to alpha
c) Root is independant
and beta in the alpha-beta pruning?
d) None of the mentioned
a) Alpha = max
Answer: a b) Beta = min
Explanation: The minimax decision c) Beta = max
are independant of the values of the d) Both Alpha = max & Beta = min
pruned values x and y because of the
Answer: d
root values.
Explanation: Alpha and beta are the
189. To which depth does the alpha- values of the best choice we have
beta pruning can be applied? found so far at any choice point along
a) 10 states the path for MAX and MIN.
b) 8 States
192. Where does the values of alpha-
c) 6 States
beta search get updated?
d) Any depth
a) Along the path of search
Answer: d b) Initial state itself
Explanation: Alpha–beta pruning can c) At the end
be applied to trees of any depth and d) None of the mentioned
it is possible to prune entire subtree
Answer: a
rather than leaves.
Explanation: Alpha-beta search
190. Which search is similar to updates the value of alpha and beta
minimax search? as it gets along and prunes the
a) Hill-climbing search remaining branches at node.
b) Depth-first search
193. How the effectiveness of the
c) Breadth-first search
alpha-beta pruning gets increased?
d) All of the mentioned
a) Depends on the nodes
Answer: b b) Depends on the order in which
Explanation: The minimax search is they are executed

40

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

c) All of the mentioned c) Alpha-beta pruning

d) None of the mentioned d) All of the mentioned

Answer: a Answer: a
Explanation: None. Explanation: Because we need to cut
the search off at some point and
194. What is called as transposition
apply an evaluation function that
table?
gives an estimate of the utility of the
a) Hash table of next seen positions
state.
b) Hash table of previously seen
positions 197. Which is created by using single
c) Next value in the search propositional symbol?
d) None of the mentioned a) Complex sentences
b) Atomic sentences
Answer: b
c) Composition sentences
Explanation: Transposition is the
d) None of the mentioned
occurrence of repeated states
frequently in the search. Answer: b
Explanation: Atomic sentences are
195. Which is identical to the closed
indivisible syntactic elements
list in Graph search?
consisting of single propositional
a) Hill climbing search algorithm
symbol.
b) Depth-first search
c) Transposition table 198. Which is used to construct the
d) None of the mentioned complex sentences?
a) Symbols
Answer: c
b) Connectives
Explanation: None.
c) Logical connectives
196. Which function is used to d) All of the mentioned
calculate the feasibility of whole
Answer: c
game tree?
Explanation: None.
a) Evaluation function
b) Transposition 199. How many proposition symbols
are there in artificial intelligence?

41

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

a) 1 202. Which are needed to compute

b) 2 the logical inference algorithm?
c) 3 a) Logical equivalence
d) 4 b) Validity
c) Satisfiability
Answer: b
d) All of the mentioned
Explanation: The two proposition
symbols are true and false. Answer: d
Explanation: Logical inference
200. How many logical connectives
algorithm can be solved be using
are there in artificial intelligence?
logical equivalence, Validity and
a) 2
satisfiability.
b) 3
c) 4 203. From which rule does the modus
d) 5 ponens are derived?
a) Inference rule
Answer: d
b) Module rule
Explanation: The five logical symbols
c) Both Inference & Module rule
are negation, conjunction,
d) None of the mentioned
disjunction, implication and
biconditional. Answer: a
Explanation: Inference rule contains
201. Which is used to compute the
the standard pattern that leads to
truth of any sentence?
desired goal. The best form of
a) Semantics of propositional logic
inference rule is modus ponens.
b) Alpha-beta pruning
c) First-order logic 204. Which is also called single
d) Both Semantics of propositional inference rule?
logic & Alpha-beta pruning a) Reference
View Answer b) Resolution
c) Reform
Answer: a
d) None of the mentioned
Explanation: Because the meaning of
the sentences is really needed to Answer: b
compute the truth. Explanation: Because resolution

42

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

yields a complete inference rule Answer: c

when coupled with any search Explanation: The scientific goal of
algorithm. artificial intelligence is to explain
various sorts of intelligence.
205. Which form is called as a
conjunction of disjunction of literals? 208. An algorithm is complete if
a) Conjunctive normal form
b) Disjunctive normal form a) It terminates with a solution when
c) Normal form one exists
d) All of the mentioned b) It starts with a solution
c) It does not terminate with a
Answer: a
solution
Explanation: None.
d) It has a loop
206. What can be viewed as a single
Answer: a
lateral of disjunction?
Explanation: An Algorithm is
a) Multiple clause
complete if It terminates with a
b) Combine clause
solution when one exists.
c) Unit clause
d) None of the mentioned 209. Which is true regarding BFS
(Breadth First Search)?
Answer: c
a) BFS will get trapped exploring a
Explanation: A single literal can be
single path
viewed as a disjunction or one literal
b) The entire tree so far been
also, called a unit clause.
generated must be stored in BFS
207. What is the goal of artificial c) BFS is not guaranteed to find a
intelligence? solution if exists
a) To solve real-world problems d) BFS is nothing but Binary First
b) To solve artificial problems Search
c) To explain various sorts of
Answer: b
intelligence
Explanation: Regarding BFS-The
d) To extract scientific causes
entire tree so far been generated
must be stored in BFS.

43

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

210. What is a heuristic function? for traversing through all the cities,
a) A function to solve mathematical without knowing in advance the
problems length of a minimum tour, is O(n!).
b) A function which takes parameters
212. What is the problem space of
of type string and returns an integer
means-end analysis?
value
a) An initial state and one or more
c) A function whose return type is
goal states
nothing
b) One or more initial states and one
d) A function that maps from
goal state
problem state descriptions to
c) One or more initial states and one
measures of desirability
or more goal state
Answer: d d) One initial state and one goal state
Explanation: Heuristic function is a
Answer: a
function that maps from problem
Explanation: The problem space of
state descriptions to measures of
means-end analysis has an initial
desirability.
state and one or more goal states.
211. The traveling salesman problem
213. An algorithm A is admissible if
involves n cities with paths
connecting the cities. The time taken
a) It is not guaranteed to return an
for traversing through all the cities,
optimal solution when one exists
without knowing in advance the
b) It is guaranteed to return an
length of a minimum tour, is
optimal solution when one exists
c) It returns more solutions, but not
a) O(n)
an optimal one
b) O(n2)
d) It guarantees to return more
c) O(n!)
optimal solutions
d) O(n/2)
Answer: b
Answer: c
Explanation: An algorithm A is
Explanation: The traveling salesman
admissible if It is guaranteed to
problem involves n cities with paths
connecting the cities. The time taken

44

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

return an optimal solution when one by representing “stereotyped

exists. situations.”.

214. Knowledge may be 217. Which of the following elements

I. Declarative. constitutes the frame structure?
II. Procedural. a) Facts or Data
III. Non-procedural. b) Procedures and default values
a) Only (I) c) Frame names
b) Only (II) d) Frame reference in hierarchy
c) Only (III)
Answer: a
d) Both (I) and (II)
Explanation: None.
Answer: d
218. Like semantic networks, frames
Explanation: Knowledge may be
can be queried using spreading
declarative and procedural.
activation.
215. What is the frame? a) True
a) A way of representing knowledge b) False
b) Data Structure
Answer: a
c) Data Type
Explanation: None.
d) None of the mentioned
219. What is Hyponymy relation?
Answer: a
a) A is part of B
Explanation: None.
b) B has A as a part of itself
216. Frames in artificial intelligence is c) A is subordinate of B
derived from semantic nets. d) A is superordinate of B
a) True
Answer: c
b) False
Explanation: In linguistics, a hyponym
Answer: a is a word or phrase whose semantic
Explanation: A frame is an artificial field is included within that of
intelligence data structure used to another word, its hypernym
divide knowledge into substructures (sometimes spelled hypernym
outside of the natural language

45

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

processing community). In simpler Answer: a

terms, a hyponym shares a type-of Explanation: The perceptron is a
relationship with its hypernym. single layer feed-forward neural
network. It is not an auto-associative
220. The basic inference mechanism
network because it has no feedback
in semantic network in which
and is not a multiple layer neural
knowledge is represented as Frames
network because the pre-processing
is to follow the links between the
stage is not made of neurons.
nodes.
a) True 223. What is an auto-associative
b) False network?
a) a neural network that contains no
Answer: a
loops
Explanation: None.
b) a neural network that contains
221. There exists two way to infer feedback
using semantic networks in which c) a neural network that has only one
knowledge is represented as Frames. loop
1) Intersection Search d) a single layer feed-forward neural
2) Inheritance Search network with pre-processing
a) True
Answer: b
b) False
Explanation: An auto-associative
Answer: a network is equivalent to a neural
Explanation: None. network that contains feedback. The
number of feedback paths(loops)
222. What is perceptron?
does not have to be one.
a) a single layer feed-forward neural
network with pre-processing 224. A 4-input neuron has weights 1,
b) an auto-associative neural network 2, 3 and 4. The transfer function is
c) a double layer auto-associative linear with the constant of
neural network proportionality being equal to 2. The
d) a neural network that contains inputs are 4, 10, 5 and 20
feedback respectively. What will be the
output?

46

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

a) 238 computer. The idea behind neural

b) 76 nets is based on the way the human
c) 119 brain works. Neural nets cannot be
d) 123 programmed, they can only learn by
examples.
Answer: a
Explanation: The output is found by 226. Which of the following is true for
multiplying the weights with their neural networks?
respective inputs, summing the (i) The training time depends on the
results and multiplying with the size of the network.
transfer function. Therefore: (ii) Neural networks can be simulated
Output = 2 * (1*4 + 2*10 + 3*5 + on a conventional computer.
4*20) = 238. (iii) Artificial neurons are identical in
operation to biological ones.
225. Which of the following is true?
a) All of the mentioned
(i) On average, neural networks have
b) (ii) is true
higher computational rates than
c) (i) and (ii) are true
conventional computers.
d) None of the mentioned
(ii) Neural networks learn by
example. Answer: c
(iii) Neural networks mimic the way Explanation: The training time
the human brain works. depends on the size of the network;
a) All of the mentioned are true the number of neuron is greater and
b) (ii) and (iii) are true therefore the number of possible
c) (i), (ii) and (iii) are true „states‟ is increased. Neural networks
d) None of the mentioned can be simulated on a conventional
computer but the main advantage of
Answer: a
neural networks – parallel execution
Explanation: Neural networks have
– is lost. Artificial neurons are not
higher computational rates than
identical in operation to the
conventional computers because a
biological ones.
lot of the operation is done in
parallel. That is not the case when 227. What are the advantages of
the neural network is simulated on a neural networks over conventional

47

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

computers? c) All of the mentioned

(i) They have the ability to learn by d) None of the mentioned
example
Answer: a
(ii) They are more fault tolerant
Explanation: Pattern recognition is
(iii)They are more suited for real time
what single layer neural networks are
operation due to their high
best at but they don‟t have the ability
„computational‟ rates
to find the parity of a picture or to
a) (i) and (ii) are true
determine whether two shapes are
b) (i) and (iii) are true
connected or not.
c) Only (i)
d) All of the mentioned 229. Which is true for neural
networks?
Answer: d
a) It has set of nodes and connections
Explanation: Neural networks learn
b) Each node computes it‟s weighted
by example. They are more fault
input
tolerant because they are always able
c) Node could be in excited state or
to respond and small changes in input
non-excited state
do not normally cause a change in
d) All of the mentioned
output. Because of their parallel
architecture, high computational Answer: d
rates are achieved. Explanation: All mentioned are the
characteristics of neural network.
228. Which of the following is true?
Single layer associative neural 230. What is Neuro software?
networks do not have the ability to: a) A software used to analyze
(i) perform pattern recognition neurons
(ii) find the parity of a picture b) It is powerful and easy neural
(iii)determine whether two or more network
shapes in a picture are connected or c) Designed to aid experts in real
not world
a) (ii) and (iii) are true d) It is software used by
b) (ii) is true Neurosurgeon

48

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: b application.
Explanation: None. a) Planning and Scheduling
b) Game Playing
231. What is Artificial intelligence?
c) Diagnosis
a) Putting your intelligence into
d) All of the mentioned
Computer
b) Programming with your own Answer: d
intelligence Explanation: All sectors require
c) Making a Machine intelligent intelligence and automation for its
d) Playing a Game working.

Answer: c 234. What is an „agent‟?

Explanation: Because AI is to make a) Perceives its environment through
things work automatically through sensors and acting upon that
machine without using human effort. environment through actuators
Machine will give the result with just b) Takes input from the surroundings
giving input from human. That means and uses its intelligence and performs
the system or machine will act as per the desired operations
the requirement. c) A embedded program controlling
line following robot
232. Which is not the commonly used
d) All of the mentioned
programming language for AI?
a) PROLOG Answer: d
b) Java Explanation: An agent is anything that
c) LISP can be viewed as perceiving and
d) Perl acting upon the environment through
the sensors and actuators. Mean it
Answer: d
takes input from its environment
Explanation: Because Perl is used as a
through sensors, performs operation
script language, and not of much use
and gives output through actuators.
for AI practice. All others are used to
generate an artificial program. 235. Agents behavior can be best
described by
233. Artificial Intelligence has its
a) Perception sequence
expansion in the following

49

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

b) Agent function measures according to what one

c) Sensors and Actuators actually wants in the environment,
d) Environment in which agent is rather than according to how one
performing thinks the agent should behave.

Answer: b 238. What is rational at any given

Explanation: An agent‟s behavior is time depends on?
described by the agent function that a) The performance measure that
maps any given percept sequence to defines the criterion of success
an action, which can be implemented b) The agent‟s prior knowledge of the
by agent program. The agent function environment
is an abstract mathematical c) The actions that the agent can
description; the agent program is a perform
concrete implementation, running on d) All of the mentioned
the agent architecture.
Answer: d
236. Rational agent is the one who Explanation: For each possible
always does the right thing. percept sequence, a rational agent
a) True should select an action that is
b) False expected to maximize its
performance measure, given the
Answer: a
evidence provided by the percept
Explanation: Rational agent is the one
sequence and whatever built-in
who always does the right thing Right
knowledge the agent has.
in a sense that it makes the agent the
most successful. 239. An omniscient agent knows the
actual outcome of its actions and can
237. Performance Measures are fixed
act accordingly; but omniscience is
for all agents.
impossible in reality. Rational Agent
a) True
always does the right thing; but
b) False
Rationality is possible in reality.
Answer: a a) True
Explanation: As a general rule, it is b) False
better to design performance

50

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: a b) partially Observable

Explanation: Refer the definition of c) All of the mentioned
rational and omniscient agents. d) None of the mentioned

240. The Task Environment of an Answer: a

agent consists of _ Explanation: In crossword puzzle an
a) Sensors agent knows the complete state of
b) Actuators the environment through its sensors.
c) Performance Measures
243. The game of Poker is a single
d) All of the mentioned
agent.
Answer: d a) True
Explanation: The task environment of b) False
an agent is described by four parts
Answer: b
performance measures, sensors,
Explanation: The game of poker
actuators and environment, generally
involves multiple player, hence its
known as the PEAS descriptions.
works in Multi-agent environment.
241. What could possibly be the
244. Satellite Image Analysis System
environment of a Satellite Image
is (Choose the one that is not
Analysis System?
applicable).
a) Computers in space and earth
a) Episodic
b) Image categorization techniques
b) Semi-Static
c) Statistical data on image pixel
c) Single agent
intensity value and histograms
d) Partially Observable
d) All of the mentioned
Answer: d
Answer: d
Explanation: System knows the
Explanation: An environment is
current status of the analysis thought
something which agent stays in.
its inputs.
242. Categorize Crossword puzzle in
245. An agent is composed of
Fully Observable / Partially
Observable.
a) Architecture
a) Fully Observable

51

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

b) Agent Function through the network to allow weights

c) Perception Sequence to be adjusted so that the network
d) Architecture and Program can learn
d) None of the mentioned
Answer: d
Explanation: An agent is anything that Answer: c
can be viewed as perceiving and Explanation: Back propagation is the
acting upon the environment through transmission of error back through
the sensors and actuators. the network to allow weights to be
adjusted so that the network can
246. Why is the XOR problem
learn.
exceptionally interesting to neural
network researchers? 248. Why are linearly separable
a) Because it can be expressed in a problems of interest of neural
way that allows you to use a neural network researchers?
network a) Because they are the only class of
b) Because it is complex binary problem that network can solve
operation that cannot be solved using successfully
neural networks b) Because they are the only class of
c) Because it can be solved by a single problem that Perceptron can solve
layer perceptron successfully
d) Because it is the simplest linearly c) Because they are the only
inseparable problem that exists. mathematical functions that are
continue
Answer: d
d) Because they are the only
Explanation: None.
mathematical functions you can draw
247. What is back propagation?
Answer: b
a) It is another name given to the
Explanation: Linearly separable
curvy function in the perceptron
problems of interest of neural
b) It is the transmission of error back
network researchers because they
through the network to adjust the
are the only class of problem that
inputs
Perceptron can solve successfully.
c) It is the transmission of error back

52

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

249. Which of the following is not the Answer: a

promise of artificial neural network? Explanation: Yes the perceptron
a) It can explain result works like that.
b) It can survive the failure of some
252. What is the name of the
nodes
function in the following statement
c) It has inherent parallelism
“A perceptron adds up all the
d) It can handle noise
weighted inputs it receives, and if it
Answer: a exceeds a certain value, it outputs a
Explanation: The artificial Neural 1, otherwise it just outputs a 0”?
Network (ANN) cannot explain result. a) Step function
b) Heaviside function
250. Neural Networks are complex
c) Logistic function
with many
d) Perceptron function
parameters.
a) Linear Functions Answer: b
b) Nonlinear Functions Explanation: Also known as the step
c) Discrete Functions function – so answer 1 is also right. It
d) Exponential Functions is a hard thresholding function, either
on or off with no in-between.
Answer: a
Explanation: Neural networks are 253. Having multiple perceptrons can
complex linear functions with many actually solve the XOR problem
parameters. satisfactorily: this is because each
perceptron can partition off a linear
251. A perceptron adds up all the
part of the space itself, and they can
weighted inputs it receives, and if it
then combine their results.
exceeds a certain value, it outputs a
a) True – this works always, and these
1, otherwise it just outputs a 0.
multiple perceptrons learn to classify
a) True
even complex problems
b) False
b) False – perceptrons are
c) Sometimes – it can also output
mathematically incapable of solving
intermediate values as well
linearly inseparable functions, no
d) Can‟t say
matter what you do

53

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

c) True – perceptrons can do this but 256. What is the field of Natural
are unable to learn to do it – they Language Processing (NLP)?
have to be explicitly hand-coded a) Computer Science
d) False – just having a single b) Artificial Intelligence
perceptron is enough c) Linguistics
d) All of the mentioned
Answer: c
Explanation: None. Answer: d
Explanation: None.
254. The network that involves
backward links from output to the 257. NLP is concerned with the
input and hidden layers is called interactions between computers and
human (natural) languages.
a) Self organizing maps a) True
b) Perceptrons b) False
c) Recurrent neural network
Answer: a
d) Multi layered perceptron
Explanation: NLP has its focus on
Answer: c understanding the human
Explanation: RNN (Recurrent neural spoken/written language and
network) topology involves backward converts that interpretation into
links from output to the input and machine understandable language.
hidden layers.
258. What is the main challenge/s of
255. Which of the following is an NLP?
application of NN (Neural Network)? a) Handling Ambiguity of Sentences
a) Sales forecasting b) Handling Tokenization
b) Data validation c) Handling POS-Tagging
c) Risk management d) All of the mentioned
d) All of the mentioned
Answer: a
Answer: d Explanation: There are enormous
Explanation: All mentioned options ambiguity exists when processing
are applications of Neural Network. natural language.

54

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

259. Modern NLP algorithms are 262. What is Machine Translation?

based on machine learning, especially a) Converts one human language to
statistical machine learning. another
a) True b) Converts human language to
b) False machine language
c) Converts any human language to
Answer: a
English
Explanation: None.
d) Converts Machine language to
260. Choose form the following areas human language
where NLP can be useful.
Answer: a
a) Automatic Text Summarization
Explanation: The best known example
b) Automatic Question-Answering
of machine translation is google
Systems
translator.
c) Information Retrieval
d) All of the mentioned 263. The more general task of
coreference resolution also includes
Answer: d
identifying so-called “bridging
Explanation: None.
relationships” involving referring
261. What is Coreference Resolution? expressions.
a) Anaphora Resolution a) True
b) Given a sentence or larger chunk b) False
of text, determine which words
Answer: a
(“mentions”) refer to the same
Explanation: Refer the definition of
objects (“entities”)
Coreference Resolution.
c) All of the mentioned
d) None of the mentioned 264. What is Morphological
Segmentation?
Answer: b
a) Does Discourse Analysis
Explanation: Anaphora resolution is a
b) Separate words into individual
specific type of coreference
morphemes and identify the class of
resolution.
the morphemes
c) Is an extension of propositional

55

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

logic Answer: c
d) None of the mentioned Explanation: Look at the general
architecture of rule based expert
Answer: b
systems.
Explanation: None.
268. There are primarily two modes
265. Autonomous
for an inference engine: forward
Question/Answering systems are
chaining and backward chaining.
_
a) True
a) Expert Systems
b) False
b) Rule Based Expert Systems
c) Decision Tree Based Systems Answer: a
d) All of the mentioned Explanation: None.

Answer: d 269. What among the following

Explanation: None. constitutes the representation of the
knowledge in different forms?
266. Which of the following are the
a) Relational method where each fact
applications of Expert systems?
is set out systematically in columns
a) Disease Diagnosis
b) Inheritable knowledge where
b) Planning and Scheduling
relational knowledge is made up of
c) Decision making
objects
d) All of the mentioned
c) Inferential knowledge
Answer: d d) All of the mentioned
Explanation: None.
Answer: d
267. What are the main components Explanation: None.
of the expert systems?
270. What are Semantic Networks?
a) Inference Engine
a) A way of representing knowledge
b) Knowledge Base
b) Data Structure
c) Inference Engine & Knowledge
c) Data Type
Base
d) None of the mentioned
d) None of the mentioned

56

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: a Answer: a
Explanation: None. Explanation: A meronym denotes a
constituent part of or a member of
272. Graph used to represent
something. That is,
semantic network is _
“X” is a meronym of “Y” if Xs are
a) Undirected graph
parts of Y(s), or
b) Directed graph
“X” is a meronym of “Y” if Xs are
c) Directed Acyclic graph (DAG)
members of Y(s).
d) Directed complete graph
275. What is Hypernym relation?
Answer: b
a) A is part of B
Explanation: Semantic Network is a
b) B has A as a part of itself
directed graph consisting of vertices,
c) A is a kind of B
which represent concepts and edges,
d) A is superordinate of B
which represent semantic relations
between the concepts. Answer: d
Explanation: In linguistics, a hyponym
273. Which of the following are the
is a word or phrase whose semantic
Semantic Relations used in Semantic
field is included within that of
Networks?
another word, its hypernym
a) Meronymy
(sometimes spelled hypernym
b) Holonymy
outside of the natural language
c) Hyponymy
processing community). In simpler
d) All of the mentioned
terms, a hyponym shares a type-of
Answer: d relationship with its hypernym.
Explanation: None.
276. What is Holonymy relation?
274. What is Meronymy relation? a) A is part of B
a) A is part of B b) B has A as a part of itself
b) B has A as a part of itself c) A is a kind of B
c) A is a kind of B d) A is superordinate of B
d) A is superordinate of B
Answer: b
Explanation: Holonymy (in Greek

57

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

holon = whole and onoma = name) is b) Partial order planning

a semantic relation. Holonymy c) Total order planning
defines the relationship between a d) Both Planning problem & Partial
term denoting the whole and a term order planning
denoting a part of, or a member of,
Answer: b
the whole. That is,
Explanation: Definition of partial
„X‟ is a holonym of „Y‟ if Ys are parts
order planning.
of Xs, or
„X‟ is a holonym of „Y‟ if Ys are 280. To complete any task, the brain
members of Xs. needs to plan out the sequence by
which to execute the behavior. One
277. The basic inference mechanism
way the brain does this is with a
in semantic network is to follow the
partial-order plan.
links between the nodes.
a) True
a) True
b) False
b) False
Answer: a
Answer: a
Explanation: None.
Explanation: None.
280. In partial order plan.
278. There exists two way to infer
A. Relationships between the actions
using semantic networks.
of the behavior are set prior to the
1) Intersection Search
actions
2) Inheritance Search
B. Relationships between the actions
a) True
of the behavior are not set until
b) False
absolutely necessary
Answer: a Choose the correct option.
Explanation: None. a) A is true
b) B is true
279. The process by which the brain
c) Either A or B can be true
incrementally orders actions needed
depending upon situation
to complete a specific task is referred
d) Neither A nor B is true
as _
a) Planning problem

58

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: a 1, but before Action 2.

Explanation: Relationship between Plan Space: The plan space of the
behavior and actions is established algorithm is constrained between its
dynamically. start and finish. The algorithm starts,
producing the initial state and
281. Partial-order planning exhibits
finishes when all parts of the goal is
the Principle of Least Commitment,
been achieved.
which contributes to the efficiency of
this planning system as a whole. 283. Partial-order planning is the
a) True opposite of total-order planning.
b) False a) True
b) False
Answer: a
Explanation: None. Answer: a
Explanation: Partial-order planning is
282. Following is/are the components
the opposite of total-order planning,
of the partial order planning.
in which actions are sequenced all at
a) Bindings
once and for the entirety of the task
b) Goal
at hand.
c) Causal Links
d) All of the mentioned 284. Sussman Anomaly illustrates a
weakness of interleaved planning
Answer: d
algorithm.
Explanation: Bindings: The bindings of
a) True
the algorithm are the connections
b) False
between specific variables in the
action. Bindings, as ordering, only Answer: b
occur when it is absolutely necessary. Explanation: Sussman Anomaly
Causal Links: Causal links in the illustrates a weakness of non
algorithm are those that categorically interleaved planning algorithm.
order actions. They are not the
285. One the main drawback of this
specific order (1,2,3) of the actions,
type of planning system is that it
rather the general order as in Action
requires a lot of computational
2 must come somewhere after Action
powers at each node.

59

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

a) True work,” “Do work,” “Go home.”) Most

b) False plans are hierarchical in nature.

Answer: a 288. A constructive approach in

Explanation: None. which no commitment is made unless
it is necessary to do so, is
286. What are you predicating by the
logic: ۷x: €y: loyalto(x, y).
a) Least commitment approach
a) Everyone is loyal to someone
b) Most commitment approach
b) Everyone is loyal to all
c) Nonlinear planning
c) Everyone is not loyal to someone
d) Opportunistic planning
d) Everyone is loyal
Answer: a
Answer: a
Explanation: Because we are not sure
Explanation: ۷x denotes Everyone or
about the outcome.
all, and €y someone and loyal to is
the proposition logic making map x to 289. Uncertainty arises in the
y. Wumpus world because the agent‟s
sensors give only _
287. A plan that describe how to take
a) Full & Global information
actions in levels of increasing
b) Partial & Global Information
refinement and specificity is
c) Partial & local Information
d) Full & local information
a) Problem solving
b) Planning Answer: c
c) Non-hierarchical plan Explanation: The Wumpus world is a
d) Hierarchical plan grid of squares surrounded by walls,
where each square can contain
Answer: d
agents and objects. The agent (you)
Explanation: A plan that describes
always starts in the lower left corner,
how to take actions in levels of
a square that will be labeled [1, 1].
increasing refinement and specificity
The agent‟s task is to find the gold,
is Hierarchical (e.g., “Do something”
return to [1, 1] and climb out of the
becomes the more specific “Go to
cave. Therefore, uncertainty is there

60

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

as the agent gives partial and local c) Between 0 & 1, between 0 & 1
information only. Global variable are d) Either 0 or 1, either 0 or 1
not goal specific problem solving.
Answer: a
290. What is the form of Fuzzy logic? Explanation: Refer the definition of
a) Two-valued logic Fuzzy set and Crisp set.
b) Crisp set logic
293. Fuzzy logic is extension of Crisp
c) Many-valued logic
set with an extension of handling the
d) Binary set logic
concept of Partial Truth.
Answer: c a) True
Explanation: With fuzzy logic set b) False
membership is defined by certain
Answer: a
value. Hence it could have many
Explanation: None.
values to be in the set.
294. The room temperature is hot.
291. Traditional set theory is also
Here the hot (use of linguistic
known as Crisp Set theory.
variable is used) can be represented
a) True
by
b) False
a) Fuzzy Set
Answer: a b) Crisp Set
Explanation: Traditional set theory c) Fuzzy & Crisp Set
set membership is fixed or exact d) None of the mentioned
either the member is in the set or
Answer: a
not. There is only two crisp values
Explanation: Fuzzy logic deals with
true or false. In case of fuzzy logic
linguistic variables.
there are many values. With weight
say x the member is in the set. 295. The values of the set
membership is represented by
292. The truth values of traditional
set theory is and that
a) Discrete Set
of fuzzy set is _
b) Degree of truth
a) Either 0 or 1, between 0 & 1
c) Probabilities
b) Between 0 & 1, either 0 or 1

61

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

d) Both Degree of truth & a) Hedges

Probabilities b) Lingual Variable
c) Fuzz Variable
Answer: b
d) None of the mentioned
Explanation: Both Probabilities and
degree of truth ranges between 0 – 1. Answer: a
Explanation: None.
296. Japanese were the first to utilize
fuzzy logic practically on high-speed 299. Fuzzy logic is usually
trains in Sendai. represented as
a) True a) IF-THEN-ELSE rules
b) False b) IF-THEN rules
c) Both IF-THEN-ELSE rules & IF-THEN
Answer: a
rules
Explanation: None.
d) None of the mentioned
297. Fuzzy Set theory defines fuzzy
Answer: b
operators. Choose the fuzzy
Explanation: Fuzzy set theory defines
operators from the following.
fuzzy operators on fuzzy sets. The
a) AND
problem in applying this is that the
b) OR
appropriate fuzzy operator may not
c) NOT
be known. For this reason, fuzzy logic
d) All of the mentioned
usually uses IF-THEN rules, or
Answer: d constructs that are equivalent, such
Explanation: The AND, OR, and NOT as fuzzy associative matrices.
operators of Boolean logic exist in Rules are usually expressed in the
fuzzy logic, usually defined as the form:
minimum, maximum, and IF variable IS property THEN action
complement;
300. Like relational databases there
298. There are also other operators, does exists fuzzy relational
more linguistic in nature, called databases.
_ that can be applied to a) True
fuzzy set theory. b) False

62

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: a 303. In LISP, the function returns t if

Explanation: Once fuzzy relations are <integer> is even and nil otherwise
defined, it is possible to develop fuzzy
relational databases. The first fuzzy a) (evenp <integer>)
relational database, FRDB, appeared b) (even <integer>)
in Maria Zemankova dissertation. c) (numeven <integer>)
d) (numnevenp <integer>)
301. _ is/are the
way/s to represent uncertainty. Answer: a
a) Fuzzy Logic Explanation: None.
b) Probability
304. Which of the following is an
c) Entropy
advantage of using an expert system
d) All of the mentioned
development tool?
Answer: d a) imposed structure
Explanation: Entropy is amount of b) knowledge engineering assistance
uncertainty involved in data. c) rapid prototyping
Represented by H(data). d) all of the mentioned

302. are algorithms Answer: d

that learn from their more complex Explanation: None.
environments (hence eco) to
305. An AI system developed by
generalize, approximate and simplify
Daniel Bobrow to read and solve
solution logic.
algebra word problems.
a) Fuzzy Relational DB
a) SHRDLU
b) Ecorithms
b) SIMD
c) Fuzzy Set
c) BACON
d) None of the mentioned
d) STUDENT
Answer: c
Answer: d
Explanation: Local structure is usually
Explanation: None.
associated with linear rather than
exponential growth in complexity. 306. The “Turing Machine” showed
that you could use a/an _ system

63

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

to program any algorithmic task. c) Fuzzy logic

a) binary d) Functional logic
b) electro-chemical
Answer: c
c) recursive
Explanation: None.
d) semantic
309. In his landmark book
Answer: a
Cybernetics, Norbert Wiener
Explanation: None.
suggested a way of modeling
307. MCC is investigating the scientific phenomena using not
improvement of the relationship energy, but _
between people and computers a) mathematics
through a technology called b) intelligence
c) information
a) computer-aided design d) history
b) human factors
Answer: c
c) parallel processing
Explanation: None.
d) all of the mentioned
310. Input segments of AI
Answer: b
programming contain(s)?
Explanation: None.
a) sound
308. The first widely-used b) smell
commercial form of Artificial c) touch
Intelligence (Al) is being used in many d) none of the mentioned
popular products like microwave
Answer: d
ovens, automobiles and plug in circuit
Explanation: None.
boards for desktop PCs. It allows
machines to handle vague 311. Which of the following
information with a deftness that applications include in the Strategic
mimics human intuition. What is the Computing Program?
name of this Artificial Intelligence? a) battle management
a) Boolean logic b) autonomous systems
b) Human logic

64

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

c) pilot‟s associate c) Deduction

d) all of the mentioned d) Introduction

Answer: d Answer: d
Explanation: None. Explanation: Different learning
methods include memorization,
312. In LISP, the function evaluates
analogy and deduction.
<object> and assigns this value to the
unevaluated <sconst>. 315. Which of the following is the
a) (constant <sconst> <object>) model used for learning?
b) (defconstant <sconst> <object>) a) Decision trees
c) (eva <sconst> <object>) b) Neural networks
d) (eva <object> <sconst>) c) Propositional and FOL rules
d) All of the mentioned
Answer: b
Explanation: None. Answer: d
Explanation: Decision trees, Neural
313. Factors which affect the
networks, Propositional rules and FOL
performance of learner system does
rules all are the models of learning.
not include?
a) Representation scheme used 316. Automated vehicle is an
b) Training scenario example of _
c) Type of feedback a) Supervised learning
d) Good data structures b) Unsupervised learning
c) Active learning
Answer: d
d) Reinforcement learning
Explanation: Factors which affect the
performance of learner system does Answer: a
not include good data structures. Explanation: In automatic vehicle set
of vision inputs and corresponding
314. Which of the following does not
actions are available to learner hence
include different learning methods?
it‟s an example of supervised
a) Memorization
learning.
b) Analogy

65

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

317. Which of the following is an c) Data may have errors

example of active learning? d) All of the mentioned
a) News Recommender system
Answer: d
b) Dust cleaning machine
Explanation: Decision trees can be
c) Automated vehicle
used in all the conditions stated.
d) None of the mentioned
320. Which of the following is not an
Answer: a
application of learning?
Explanation: In active learning, not
a) Data mining
only the teacher is available but the
b) WWW
learner can ask suitable perception-
c) Speech recognition
action pair examples to improve
d) None of the mentioned
performance.
Answer: d
318. In which of the following
Explanation: All mentioned options
learning the teacher returns reward
are applications of learning.
and punishment to learner?
a) Active learning 321. Which of the following is the
b) Reinforcement learning component of learning system?
c) Supervised learning a) Goal
d) Unsupervised learning b) Model
c) Learning rules
Answer: b
d) All of the mentioned
Explanation: Reinforcement learning
is the type of learning in which Answer: d
teacher returns reward or Explanation: Goal, model, learning
punishment to learner. rules and experience are the
components of learning system.
319. Decision trees are appropriate
for the problems where _ 322. Which of the following is also
a) Attributes are both numeric and called as exploratory learning?
nominal a) Supervised learning
b) Target function takes on a discrete b) Active learning
number of values.

66

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

c) Unsupervised learning described as “the mapping of

d) Reinforcement learning function onto form”?
a) Design
Answer: c
b) Distribution
Explanation: In unsupervised
c) Project management
learning, no teacher is available
d) Field service
hence it is also called unsupervised
learning. Answer: a
Explanation: None.
323. When talking to a speech
recognition program, the program 326. Which kind of planning consists
divides each second of your speech of successive representations of
into 100 separate different levels of a plan?
a) Codes a) hierarchical planning
b) Phonemes b) non-hierarchical planning
c) Samples c) project planning
d) Words d) all of the mentioned

Answer: c Answer: a
Explanation: None. Explanation: None.

324. Which term is used for 327. What was originally called the
describing the judgmental or “imitation game” by its creator?
commonsense part of problem a) The Turing Test
solving? b) LISP
a) Heuristic c) The Logic Theorist
b) Critical d) Cybernetics
c) Value based
Answer: a
d) Analytical
Explanation: None.
Answer: a
328. Decision support programs are
Explanation: None.
designed to help managers make
325. Which stage of the _
manufacturing process has been a) budget projections

67

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

b) visual presentations instruction

c) business decisions d) expert systems
d) vacation schedules
Answer: c
Answer: c Explanation: None.
Explanation: None.
332. Which of the following function
329. ART (Automatic Reasoning Tool) returns t If the object is a symbol m
is designed to be used on LISP?
_ a) (* <object>)
a) LISP machines b) (symbolp <object>)
b) Personal computers c) (nonnumeric <object>)
c) Microcomputers d) (constantp <object>)
d) All of the mentioned
Answer: b
Answer: a Explanation: None.
Explanation: None.
333. The symbols used in describing
330. Which particular generation of the syntax of a programming
computers is associated with artificial language are _
intelligence? a) 0
a) Second b) {}
b) Fourth c) “”
c) Fifth d) <>
d) Third
Answer: d
Answer: c Explanation: None.
Explanation: None.
334. How many kinds of mutation are
331. Shaping teaching techniques to found in DNA which includes
fit the learning patterns of individual mutation of only one base?
students is the goal of a) 1
a) decision support b) 2
b) automatic programming c) 3
c) intelligent computer-assisted d) 4

68

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: b a) True
Explanation: There are two kinds of b) False
mutation which is observed in the
Answer: b
DNA that include only one base and
Explanation: The mutation occurs at a
are also known as point mutation.
particular mutation prone region
These mutations are transition where
known as the hot spots. The hot
the mutation occurs chancing a
spots are rich in di- or tri- nucleotide
purine to purine and pyrimidine to
repeat sequences known as
pyrimidine, and transversion where
microsatellites.
there purine is converted to purine
and vice versa. 337. What is the dinucleotide
sequence of microsatellites?
335. What is the overall rate at which
a) CA
new mutations arise spontaneously
b) AT
at any given site on the chromosome
c) CC
per round of replication?
d) GC
a) ≈ 10-8 – 10-12
b) ≈ 10-7 – 10-9 Answer: a
c) ≈ 10-6 – 10-11 Explanation: Microsatellites involves
d) ≈ 10-5 – 10-10 the repeats of the dinucleotide
sequence of CA. the CA repeat is
Answer: c
found at many widely scattered sites
Explanation: The overall rate at which
in the genome of humans and other
new mutations arise spontaneously
eukaryotes.
at any given site on the chromosome
ranges from ≈ 10-6 – 10-11 per round 338. By which process miss-
of DNA replication. With some sites incorporated base can change into a
on the chromosomes being hot spots, permanent mutation?
mutations arise at a high frequency in a) Replication
these sites. b) Transcription
c) Translation
336. The mutation occurs at a
d) Transposition
random basis within a genome.

69

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: a Answer: c
Explanation: A potential mutation Explanation: The mismatch repair
may be introduced by system involves two steps. The first
misincorporation in any round of step involves the scanning of the
replication. In the next round of genome for mismatches. The second
replication if the mutation is not step ensures the correction of
repaired it gets permanently mismatch that has occurred in the
incorporated in the DNA sequence. genome.

339. Detection of mismatches and 241. An Artificial Intelligence

fidelity of replication is maintained by technique that allows computers to
mutation repair system. understand associations and
a) True relationships between objects and
b) False events is called _ _
a) heuristic processing
Answer: a
b) cognitive science
Explanation: Proofreading by the
c) relative symbolism
polymerase is not always perfect and
d) pattern matching
some mismatches may escape the
detection which can become a Answer: c
permanent mutation if not corrected. Explanation: None.
This fidelity check is done by the
342. What is the name of the
mutation repair system; more
computer program that simulates the
precisely mismatch repair system, of
thought processes of human beings?
the cell itself ensuring that perfect
a) Human logic
matches occur in the complementary
b) Expert reason
strands.
c) Expert system
340. How many steps are required to d) Personal information
attain mismatch repair?
Answer: c
a) 1
Explanation: None.
b) 3
c) 2 343. What is the name of the
d) 4 computer program that contains the

70

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

distilled knowledge of an expert? commonsense part of problem

a) Database management system solving?
b) Management information System a) Heuristic
c) Expert system b) Critical
d) Artificial intelligence c) Value based
d) Analytical
Answer: c
Explanation: None. Answer: a
Explanation: None.
344. Claude Shannon described the
operation of electronic switching 347. What was originally called the
circuits with a system of “imitation game” by its creator?
mathematical logic called a) The Turing Test
_ b) LISP
a) LISP c) The Logic Theorist
b) XLISP d) Cybernetics
c) Neural networking
Answer: a
d) Boolean algebra
Explanation: None.
Answer: c
348. A series of Artificial Intelligence
Explanation: None.
systems, developed by Pat Langley to
345. A computer program that explore the role of heuristics in
contains expertise in a particular scientific discovery is _
domain is called? a) RAMD
a) intelligent planner b) BACON
b) automatic processor c) MIT
c) expert system d) DU
d) operational symbolizer
Answer: b
Answer: c Explanation: None.
Explanation: None.
349. A.M. turing developed a
346. What is the term used for technique for determining whether a
describing the judgmental or computer could or could not

71

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

demonstrate the artificial 352. Which of the following, is a

Intelligence, Presently, this technique component of an expert system?
is called a) inference engine
a) Turing Test b) knowledge base
b) Algorithm c) user interface
c) Boolean Algebra d) all of the mentioned
d) Logarithm
Answer: d
Answer: a Explanation: None.
Explanation: None.
353. A computer vision technique
350. A Personal Consultant that relies on image templates is
knowledge base contain information _
in the form of a) edge detection
a) parameters b) binocular vision
b) contexts c) model-based vision
c) production rules d) robot vision
d) all of the mentioned
Answer: c
Answer: d Explanation: None.
Explanation: None.
354. In LISP, the function (copy-list
351. Which approach to speech <list>)
recognition avoids the problem a) returns a new list that is equal to
caused by the variation in speech <list> by copying the top-level
patterns among different speakers? element of <list>
a) Continuous speech recognition b) returns the length of <list>
b) Isolated word recognition c) returns t if <list> is empty
c) Connected word recognition d) all of the mentioned
d) Speaker-dependent recognition
Answer: a
Answer: d Explanation: None.
Explanation: None.
355. Who is the “father” of artificial
intelligence?

72

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

a) Fisher Ada 358. A process that is repeated,

b) John McCarthy evaluated, and refined is called
c) Allen Newell _
d) Alan Turning a) diagnostic
b) descriptive
Answer: a
c) interpretive
Explanation: None.
d) iterative
356. In 1985, the famous chess player
Answer: d
David Levy beat a world champion
Explanation: None.
chess program in four straight games
by using orthodox moves that 359. Visual clues that are helpful in
confused the program. What was the computer vision include
name of the chess program? a) color and motion
a) Kaissa b) depth and texture
b) CRAY BLITZ c) height and weight
c) Golf d) color and motion, depth and
d) DIGDUG texture

Answer: b Answer: d
Explanation: None. Explanation: None.

357. The explanation facility of an 360. A heuristic is a way of trying

expert system may be used to
_ a) To discover something or an idea
a) construct a diagnostic model embedded in a program
b) expedite the debugging process b) To search and measure how far a
c) explain the system‟s reasoning node in a search tree seems to be
process from a goal
d) expedite the debugging process & c) To compare two nodes in a search
explain the system‟s reasoning tree to see if one is better than
process another
d) All of the mentioned
Answer: d
Explanation: None.

73

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: d 363. Uninformed search strategies

Explanation: In a heuristic approach, are better than informed search
we discover certain idea and use strategies.
heuristic functions to search for a a) True
goal and predicates to compare b) False
nodes. Answer: a
Explanation: Informed search
361. A* algorithm is based on
strategies uses some problem specific
knowledge, hence more efficient to
a) Breadth-First-Search
finding goals.
b) Depth-First –Search
c) Best-First-Search 364. Best-First search is a type of
d) Hill climbing informed search, which uses
_ to choose the
Answer: c
best next node for expansion.
Explanation: Best-first-search is giving
a) Evaluation function returning
the idea of optimization and quick
lowest evaluation
choose of path, and all these
b) Evaluation function returning
characteristic lies in A* algorithm.
highest evaluation
362. The search strategy the uses a c) Evaluation function returning
problem specific knowledge is known lowest & highest evaluation
as _ d) None of them is applicable
a) Informed Search
Answer: a
b) Best First Search
Explanation: Best-first search is an
c) Heuristic Search
instance of the general TREE-SEARCH
d) All of the mentioned
or GRAPH-SEARCH algorithm in which
Answer: d a node is selected for expansion
Explanation: The problem specific based on an evaluation function, f
knowledge is also known as (n). Traditionally, the node with the
Heuristics and Best-First search uses lowest evaluation is selected for
some heuristic to choose the best expansion, because the evaluation
node for expansion. measures distance to the goal.

74

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

365. Best-First search can be 367. Heuristic function h(n) is

implemented using the following
data structure. a) Lowest path cost
a) Queue b) Cheapest path from root to goal
b) Stack node
c) Priority Queue c) Estimated cost of cheapest path
d) Circular Queue from root to goal node
d) Average path cost
Answer: c
Explanation: Best-first search can be Answer: c
implemented within our general Explanation: Heuristic is an estimated
search framework via a priority cost.
queue, a data structure that will
368. Greedy search strategy chooses
maintain the fringe in ascending
the node for expansion in
order of f-values.

366. The name “best-first search” is a a) Shallowest

venerable but inaccurate one. After b) Deepest
all, if we could really expand the best c) The one closest to the goal node
node first, it would not be a search at d) Minimum heuristic cost
all; it would be a straight march to
Answer: c
the goal. All we can do is choose the
Explanation: Sometimes minimum
node that appears to be best
heuristics can be used, sometimes
according to the evaluation function.
maximum heuristics function can be
a) True
used. It depends upon the application
b) False
on which the algorithm is applied.
Answer: a
369. What is the evaluation function
Explanation: If the evaluation
in greedy approach?
function is exactly accurate, then this
a) Heuristic function
will indeed be the best node; in
b) Path cost from start node to
reality, the evaluation function will
current node
sometimes be off, and can lead the
c) Path cost from start node to
search astray.

75

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

current node + Heuristic cost current node + Heuristic cost

d) Average of Path cost from start d) Average of Path cost from start
node to current node and Heuristic node to current node and Heuristic
cost cost

Answer: a Answer: c
Explanation: Greedy best-first Explanation: The most widely-known
search3 tries to expand the node that form of best-first search is called A*
is closest to the goal, on the grounds search. It evaluates nodes by
that this is likely to lead to a solution combining g(n), the cost to reach the
quickly. Thus, it evaluates nodes by node, and h(n.), the cost to get from
using just the heuristic function: f (n) the node to the goal: f(n) = g(n) +
= h(n). h(n). Since g(n) gives the path cost
from the start node to node n, and
370. What is the space complexity of
h(n) is the estimated cost of the
Greedy search?
cheapest path from n to the goal.
a) O(b)
b) O(bl) 372. A* is optimal if h(n) is an
c) O(m) admissible heuristic-that is, provided
d) O(bm) that h(n) never underestimates the
cost to reach the goal.
Answer: d
a) True
Explanation: O(bm) is the space
b) False
complexity where b is the branching
factor and m is the maximum depth Answer: a
of the search tree. Since this Explanation: A* is optimal if h(n) is an
algorithm resembles the DFS. admissible heuristic-that is, provided
that h(n) never overestimates the
371. What is the evaluation function
cost to reach the goal. Refer both the
in A* approach?
example from the book for better
a) Heuristic function
understanding of the algorithms.
b) Path cost from start node to
current node 373. The process by which the brain
c) Path cost from start node to orders actions needed to complete a

76

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

specific task is referred as used to give better heuristic

estimates.
a) Planning problem
376. Planning graphs consists of
b) Partial order planning
c) Total order planning
a) a sequence of levels
d) Both Planning problem & Partial
b) a sequence of levels which
order planning
corresponds to time steps in the plan
Answer: d c) a sequence of actions which
Explanation: None. corresponds to the state of the
system
374. The famous spare tire problem
d) none of the mentioned
or Scheduling classes for bunch of
students or Air cargo transport are Answer: b
the best example of Explanation: Planning graphs is a
a) Planning problem sequence of levels, which
b) Partial Order planning problem corresponds to time steps in the plan
c) Total order planning where level 0 is the initial state at
d) None of the mentioned start.

Answer: a 377. Planning graphs works only for

Explanation: None. prepositional planning problems.
a) True
375. To eliminate the inaccuracy
b) False
problem in planning problem or
partial order planning problem we Answer: a
can use _ data Explanation: Planning graphs work
structure/s. only for propositional planning
a) Stacks problems-ones with no variables.
b) Queue Both STRIPS and ADL representations
c) BST (Binary Search Tree) can be propositionalized. For
d) Planning Graphs problems with large numbers and
objects, this could result in a very
Answer: d
Explanation: A planning graph can be

77

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

substantial blowup in the number of b) Linearization

action schemata. c) Solarization
d) None of the mentioned
378. algorithms is
used to extract the plan directly from Answer: b
the planning graph, rather than using Explanation: Each and every total
graph to provide heuristic. order plan is also called as
a) BFS/DFS linearization of the partial-order plan.
b) A*
381. What are the two major aspects
c) Graph-Plan
which combines AI Planning
d) Greedy
problem?
Answer: c a) Search & Logic
Explanation: None. b) Logic & Knowledge Based Systems
c) FOL & Logic
379. Planning problem can be
d) Knowledge Based Systems
described as a propositional logic.
a) True Answer: a
b) False Explanation: None.

Answer: a 382. algorithm translates

Explanation: Yes, The approach we a planning problem in to
take is based on testing the prepositional axioms.
satisfiability of a logical sentence a) GraphPlan
rather than on proving a theorem. b) SatPlan
We will be finding models of c) Greedy
propositional sentences that look like d) None of the mentioned
this:
Answer: b
Initial state /\ all possible action
Explanation: The SATPLAN algorithm
descriptions /\ goal.
translates a planning problem into
380. What is the other name of each propositional axioms and applies a
plan resulted in partial order satisfiability algorithm to find a model
planning? that corresponds a valid plan.
a) Polarization

78

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

383. planning allows 386. Incorrect information results in

the agent to take advice from the unsatisfied preconditions for actions
domain designer in the form of and plans detects
decomposition rules. violations of the preconditions for
a) GraphPlan successful completion of the plan.
b) Hierarchical task network (HTN) a) Conditional Plan
c) SatPlan b) Conformant Planning
d) None of the mentioned c) Execution monitoring
d) Both Conditional Plan & Execution
Answer: b
monitoring
Explanation: None.
Answer: c
384. Standard planning algorithms
Explanation: None.
assumes environment to be
387. What is the extraction of the
a) Deterministic meaning of utterance?
b) Fully observable a) Syntactic
c) Single agent b) Semantic
d) Stochastic c) Pragmatic
d) None of the mentioned
Answer: a
Explanation: It assumes complete and Answer: b
correct information, deterministic Explanation: Semantic analysis is
and fully-observable environment, used to extract the meaning from the
which many domains violates. group of

385. A re-planning agent uses 388. What is used to augment a

execution monitoring and splices in grammar for arithmetic expression
repairs as needed. with semantics?
a) True a) Notation
b) False b) DCG notation
c) Constituent
Answer: a
d) All of the mentioned
Explanation: None.

79

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: b b) Intermediate form

Explanation: DCG notation is used to c) Grammer
augment a grammar for arithmetic d) All of the mentioned
expression with semantics and it is
Answer: b
used to build a parse tree.
Explanation: None.
389. What can‟t be done in the
392. What is meant by quasi-logical
semantic interpretation?
form?
a) Logical term
a) Sits between syntactic and logical
b) Complete logical sentence
form
c) Both Logical term & Complete
b) Logical connectives
logical sentence
c) All of the mentioned
d) None of the mentioned
d) None of the mentioned
Answer: c
Answer: a
Explanation: Some kind of sentence
Explanation: It can be translated into
in the semantic interpretation can‟t
a regular first-order logical sentence,
be logical term nor a complete logical
So that it Sits between syntactic and
sentence.
logical form.
390. How many verb tenses are there
393. How many types of
in the English language?
quantification are available in
a) 1
artificial intelligence?
b) 2
a) 1
c) 3
b) 2
d) 4
c) 3
Answer: c d) 4
Explanation: There are three types of
Answer: b
tenses available in english language
Explanation: There are two types of
are past, present and future.
quantification available. They are
391. Which is used to mediate universal and existential.
between syntax and semantics?
a) Form

80

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

394. What kind of interpretation is Answer: a

done by adding context-dependant Explanation: In synchronous update,
information? all units are updated simultaneously.
a) Semantic
397. What is asynchronous update in
b) Syntactic
hopfield model?
c) Pragmatic
a) all units are updated
d) None of the mentioned
simultaneously
Answer: c b) a unit is selected at random and its
Explanation: None. new state is computed
c) a predefined unit is selected and its
395. How can states of units be
new state is computed
updated in hopfield model?
d) none of the mentioned
a) synchronously
b) asynchronously Answer: b
c) synchronously and asynchronously Explanation: In asynchronous update,
d) none of the mentioned a unit is selected at random and its
new state is computed.
Answer: c
Explanation: States of units be 398. Asynchronous update ensures
updated synchronously and that the next state is atmost unit
asynchronously in hopfield model. hamming distance from current state,
is that true?
396. What is synchronous update in
a) yes
hopfield model?
b) no
a) all units are updated
simultaneously Answer: a
b) a unit is selected at random and its Explanation: Asynchronous update
new state is computed ensures that the next state is at most
c) a predefined unit is selected and its unit hamming distance from current
new state is computed state.
d) none of the mentioned
399. If pattern is to be stored, then
what does stable state should have
updated value of?

81

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

a) current sate 402. For analysis of storage capacity

b) next state what are the conditions imposed on
c) both current and next state hopfield model?
d) none of the mentioned a) symmetry of weights
b) asynchronous update
Answer: a
c) symmetry of weights and
Explanation: Stable state should have
asynchronous update
updated value of current sate.
d) none of the mentioned
400. For symmetric weights there
Answer: c
exist?
Explanation: For analysis of storage
a) basins of attraction corresponding
capacity, symmetry of weights and
to energy minimum
asynchronous update conditions are
b) false wells
imposed on hopfield model.
c) fluctuations in energy landscape
d) none of he mentioned 403. Reinforcement learning is also
known as learning with critic?
Answer: a
a) yes
Explanation: For symmetric weights
b) no
there exist a stable point.
Answer: a
401. If connections are not symmetric
Explanation: Since this is evaluative &
then basins of attraction may
not instructive.
correspond to?
a) oscillatory regions 404. How many types of
b) stable regions reinforcement learning exist?
c) chaotic regions a) 2
d) oscillatory or chaotic regions b) 3
c) 4
Answer: d
d) 5
Explanation: If connections are not
symmetric then basins of attraction Answer: b
may correspond to oscillatory or Explanation: Fixed credit assignment,
chaotic regions. probablistic credit assignment,
temporal credit assignment.

82

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

405. Which one of the following is d) LALR canonical LR

true at any valid state in shift-reduce
parsing? Answer: c
a) At the bottom we find the prefixes Explanation parser algorithm is
b) None of the mentioned simple.
c) Stack contains only viable prefixes
408. Consider the following grammar
d) Stack consists of viable prefixes
G.
Answer: c
Explanation: The prefixes on the stack
of a shift-reduce parser are called
viable prefixes.
406. Match the following.
Which one is true?
S1: All strings generated by G can be
parsed with help of LL (1).
1. Graph S2: All strings generated by G can be
coloring
parsed with help of LR (1).
a) Only S1
minimization
b) Only S2
c) Both S1 & S2
traversal
d) None of the mentioned
Production tree
Answer: d
a) A – 2, B – 3, C – 1, D – 4 Explanation: There is ambiguity as the
b) A – 2, B – 1, C – 4, D – 3 string can be derived in 2 possible
c) A – 2, B – 4, C – 1, D – 3 ways.
d) A – 2, B – 3, C – 4, D – 1 First Leftmost Derivation
S →F
Answer: c F→c
Explanation: The entire column an Second Leftmost Derivation
items matches the Column B items in S→H
a certain way. H → c.
407. Which of the following pairs is 409. What is the maximum number
the most powerful? of reduce moves that can be taken by
a) SLR, LALR a bottom-up parser for a grammar
b) Canonical LR ,LALR with no epsilon- and unit-production
c) SLR canonical LR to parse a string with n tokens?
83

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

a) n/2 d) It can derive any sentence that is

b) n-1 an entailed version & It is truth
c) 2n-1 preserving
d) 2^n
Answer: d
Answer: b Explanation: None.
Explanation: The moves are n-1.
413. An inference algorithm that
410. Which is not a property of
derives only entailed sentences is
representation of knowledge?
called sound or truth-preserving.
a) Representational Verification
a) True
b) Representational Adequacy
b) False
c) Inferential Adequacy
d) Inferential Efficiency Answer: a
Explanation: None.
Answer: a
Explanation: None. 415. A network with named nodes
and labeled arcs that can be used to
411. Which is not Familiar
represent certain natural language
Connectives in First Order Logic?
grammars to facilitate parsing.
a) and
a) Tree Network
b) iff
b) Star Network
c) or
c) Transition Network
d) not
d) Complete Network
Answer: d
Answer: c
Explanation: “not” is coming under
Explanation: None.
propositional logic and is therefore
not a connective. 416. Computers normally solve
problem by breaking them down into
412. Inference algorithm is complete
a series of yes-or-no decisions
only if _
represented by 1s and 0s. What is the
a) It can derive any sentence
name of the logic that allows
b) It can derive any sentence that is
computers to assign numerical values
an entailed version
that fail somewhere between 0 and
c) It is truth preserving

84

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

1? b) writing
a) Human logic c) speaking
b) Fuzzy logic d) seeing
c) Boolean logic
Answer: d
d) Operational logic
Explanation: None.
Answer: b
420. The Newell and Simon program
Explanation: None.
that proved theorems of Principal
417. The company that grew out of Mathematical was
research at the MIT AI lab is a) Elementary Perceiver
b) General Problem Solver
a) AI corp c) Logic Theorist
b) LMI d) Boolean Algebra
c) Symbolics
Answer: c
d) Both LMI & Symbolics
Explanation: None.
Answer: d
421. Using logic to represent and
Explanation: None.
reason we can represent knowledge
418. Which technique is being about the world with facts and rules.
investigated as an approach to a) True
automatic programming? b) False
a) generative CAI
Answer: a
b) specification by example
Explanation: None.
c) non-hierarchical planning
d) all of the mentioned 422. Uncertainty arises in the
wumpus world because the agent‟s
Answer: b
sensors give only
Explanation: None.
a) Full & Global information
419. The primary method that people b) Partial & Global Information
use to sense their environment is c) Partial & local Information
d) Full & local information
a) reading

85

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

Answer: c 424. How is Fuzzy Logic different

Explanation: The Wumpus world is a from conventional control methods?
grid of squares surrounded by walls, a) IF and THEN Approach
where each square can contain b) FOR Approach
agents and objects. The agent (you) c) WHILE Approach
always starts in the lower left corner, d) DO Approach
a square that will be labeled [1, 1].
Answer: a
The agent‟s task is to find the gold,
Explanation: FL incorporates a simple,
return to [1, 1] and climb out of the
rule-based IF X AND Y THEN Z
cave. So uncertainty is there as the
approach to a solving control
agent gives partial and local
problem rather than attempting to
information only. Global variable are
model a system mathematically.
not goal specific problem solving.
425. If a hypothesis says it should be
423. A Hybrid Bayesian network
positive, but in fact it is negative, we
contains
call it
a) Both discrete and continuous
a) A consistent hypothesis
variables
b) A false negative hypothesis
b) Only Discrete variables
c) A false positive hypothesis
c) Only Discontinuous variable
d) A specialized hypothesis
d) Both Discrete and Discontinuous
variable Answer: c
Explanation: Consistent hypothesis go
Answer: a
with examples, If the hypothesis says
Explanation: To specify a Hybrid
it should be negative but in fact it is
network, we have to specify two new
positive, it is false negative. If a
kinds of distributions: the conditional
hypothesis says it should be positive,
distribution for continuous variables
but in fact it is negative, it is false
given discrete or continuous parents,
positive. In a specialized hypothesis
and the conditional distribution for a
we need to have certain restrict or
discrete variable given continuous
special conditions.
parents.

86

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

426. The primitives in probabilistic return to [1, 1] and climb out of the
reasoning are random variables. cave. So uncertainty is there as the
a) True agent gives partial and local
b) False information only. Global variable are
not goal specific problem solving.
Answer: a
Explanation: The primitives in 428. A constructive approach in
probabilistic reasoning are random which no commitment is made unless
variables. Just like primitives in it is necessary to do so is
Propositional Logic are propositions.
A random variable is not in fact a a) Least commitment approach
variable, but a function from a b) Most commitment approach
sample space S to another space, c) Nonlinear planning
often the real numbers. d) Opportunistic planning

427. Which is true for Decision Answer: a

theory? Explanation: Because we are not sure
a) Decision Theory = Probability about the outcome.
theory + utility theory
429. How many types of recognition
b) Decision Theory = Inference theory
are there in artificial intelligence?
+ utility theory
a) 1
c) Decision Theory = Uncertainty +
b) 2
utility theory
c) 3
d) Decision Theory = Probability
d) 4
theory + preference
Answer: c
Answer: c
Explanation: The three types of
Explanation: The Wumpus world is a
recognition are biometric
grid of squares surrounded by walls,
identification, content-based image
where each square can contain
retrieval and handwriting recognition.
agents and objects. The agent (you)
always starts in the lower left corner, 430. Which provides a framework for
a square that will be labeled [1, 1]. studying object recognition?
The agent‟s task is to find the gold, a) Learning

87

Downloaded by Prudhvi Dil ([email protected])

 lOMoARcPSD|5982446

b) Unsupervised learning
c) Supervised learning
d) None of the mentioned

Answer: c
Explanation: Supervised learning or
pattern classification provides a
framework for studying object
recognition.

88

Downloaded by Prudhvi Dil ([email protected])