AIR 3 Units MCQ

Name of Faculty: Prof.
Sagar Rane
Name of Subject: Artificial Intelligence and Robotics
Year and Branch: BE(COMP)
Q. Uni Difficulty levels BT
Correct
No Description Question Choices t (Easy/Medium/Hard Level
No. ) Answer
. s
Unit I- Introduction
1 Which of the following contains the output a) Printed language and

segments of Artificial Intelligence synthesized speech
programming? b) Manipulation of physical d) All of the
1 Easy 1
object mentioned
c) Locomotion
d) All of the mentioned
2 LISP was created by? a) John McCarthy
b) Marvin Minsky
a) John
c) Alan Turing 1 Medium 1
McCarthy
d) Allen Newell and Herbert
Simon
3 What is Artificial intelligence? a) Putting your intelligence
into Computer
b) Programming with your c) Making a
own intelligence 1 Easy 1 Machine
c) Making a Machine intelligent
intelligent
d) Playing a Game
4 Which search method takes less memory? a) Depth-First Search
b) Breadth-First search a) Depth-First
1 Medium 2
c) Optimal search Search
d) Linear Search
5 A heuristic is a way of trying __________ a) To discover something or 1 Medium 2 d) All of the
an idea embedded in a mentioned
program
b) To search and measure
1|Page Army Institute of Technology, Pune

Name of Faculty: Prof. Sagar Rane
Correct
No. ) Answer
. s
how far a node in a search
tree seems to be from a goal
c) To compare two nodes in a
search tree to see if one is
better than the other is
6 The performance of an agent can be a) Learning
improved by __________ b) Observing
1 Medium 2 a) Learning
c) Perceiving
d) None of the mentioned
7 An Artificial Neural Network Is based on? a) Strong Artificial Intelligence
approach
b) Weak Artificial Intelligence c) Cognitive
approach Artificial
1 Medium 2
c) Cognitive Artificial Intelligence
Intelligence approach approach
d) Applied Artificial
Intelligence approach
8 Which of the following task/tasks Artificial a) Understand natural
Intelligence could not do yet? language robustly
b) Web mining d) All of the
1 Medium 2
c) Construction of plans in real mentioned
time dynamic systems
9 What among the following is/are the a) Human 1
example of the intelligent agent/agents? b) Robot d) All of the
Medium 2
c) Autonomous Spacecraft mentioned

Correct
No. ) Answer
. s
10 Which is the most straightforward approach a) Best-first search 1
for planning algorithm? b) State-space search b) State-
Medium 2
c) Depth-first search space search
d) Hill-climbing search
11 What are taken into account of state-space a) Postconditions 1
search? b) Preconditions d) Both
c) Effects Medium 2 Preconditions
d) Both Preconditions & & Effects
Effects
12 How many ways are available to solve the a) 1 1
state-space search? b) 2
Medium 2 b) 2
c) 3
d) 4
13 What is an ‘agent’? a) Perceives its environment 1
through sensors and acting
upon that environment
through actuators
b) Takes input from the
d) All of the
surroundings and uses its Medium 2
mentioned
intelligence and performs the
desired operations
c) A embedded program
controlling line following robot
14 Rational agent is the one who always does a) True 1
b) False
Medium 2 a) True
the right thing.
15 Categorize Crossword puzzle in Fully a) Fully Observable 1 Medium 2 a) Fully
Observable / Partially Observable. b) partially Observable Observable

Correct
No. ) Answer
. s
c) All of the mentioned
16 The game of Poker is a single agent. a) True 1
Medium 2 b) False
b) False
17 Depth First Search is equivalent to which of a) Pre-order Traversal 1
the traversal in the Binary Trees? b) Post-order Traversal a) Pre-order
Medium 2
c) Level-order Traversal Traversal
d) In-order Traversal
18 Time Complexity of DFS is? (V – number of a) O(V + E) 1
vertices, E – number of edges) b) O(V)
Hard 4 a) O(V + E)
c) O(E)
d) O(V*E)
19 The Data structure used in standard a) Stack 1
implementation of Breadth First Search is? b) Queue
Medium 2 a) Stack
c) Linked List
d) Tree
20 A person wants to visit some places. He a) Depth First Search 1
starts from a vertex and then wants to visit b) Breadth First Search
every vertex till it finishes from one vertex, c) Trim’s algorithm a) Depth First
d) Kruskal’s Algorithm Medium 3
backtracks and then explore other vertex Search
from same vertex. What algorithm he
should use?
21 Which are necessary for an agent to solve a) Actions 1
an online search problem? b) Step-cost function d) All of the
Medium 2
c) Goal-test mentioned
22 Which of the following algorithm is online a) Breadth-first search 1 Medium 2 c) Hill-

Correct
No. ) Answer
. s
search algorithm? algorithm
b) Depth-first search algorithm climbing
c) Hill-climbing search search
algorithm algorithm
23 In many problems the path to goal is a) Informed Search 1
irrelevant, this class of problems can be Techniques
solved using ____________ b) Uninformed Search c) Local
Techniques Medium 2 Search
c) Local Search Techniques Techniques
d) Informed & Uninformed
Search Techniques
24 _______________ Is an algorithm, a loop a) Up-Hill Search 1
that continually moves in the direction of b) Hill-Climbing b) Hill-
Medium 2
increasing value – that is uphill. c) Hill algorithm Climbing
d) Reverse-Down-Hill search
25 When will Hill-Climbing algorithm terminate? a) Stopping criterion met 1
b) Global Min/Max is achieved c) No
c) No neighbor has higher Medium 2 neighbor has
value higher value
26 What are the main cons of hill-climbing a) Terminates at local 1 Medium 2 a) Terminates
search? optimum & Does not find at local
optimum solution optimum &
b) Terminates at global Does not find
optimum & Does not find optimum
optimum solution solution
c) Does not find optimum

Correct
No. ) Answer
. s
solution & Fail to find a
solution
d) Fail to find a solution
27 Hill-Climbing approach stuck for which of a) Local maxima 1
the following reasons? b) Ridges d) All of the
Hard 3
c) Plateaux mentioned
28 What are the two main features of Genetic a) Fitness function & 1
Algorithm? Crossover techniques
b) Crossover techniques &
a) Fitness
Random mutation
function &
c) Individuals among the Medium 2
Crossover
population & Random
techniques
mutation
d) Random mutation & Fitness
function
29 Searching using query on Internet is, use of a) Offline agent 1
d) Goal
___________ type of agent. b) Online agent
Medium 2 Based &
c) Both Offline & Online agent
Online agent
d) Goal Based & Online agent
30 Which search strategy is also called as a) Uninformed search 1
a)
blind search? b) Informed search
Medium 2 Uninformed
c) Simple reflex search
search
31 When is breadth-first search is optimal? a) When there is less number 1 Medium 2 b) When all
of nodes step costs
b) When all step costs are are equal
equal

Correct
No. ) Answer
. s
c) When all step costs are
unequal
32 How many successors are generated in a) 1 1
backtracking search? b) 2
Medium 2 a) 1
c) 3
d) 4
33 Which search algorithm imposes a fixed a) Depth-limited search 1
depth limit on nodes? b) Depth-first search a) Depth-
Medium 2
c) Iterative deepening search limited search
d) Bidirectional search
34 What is the other name of informed search a) Simple search 1
strategy? b) Heuristic search b) Heuristic
Medium 2
c) Online search search
35 What is the heuristic function of greedy a) f(n) != h(n) 1
best-first search? b) f(n) < h(n)
Hard 3 c) f(n) = h(n)
c) f(n) = h(n)
d) f(n) > h(n)
36 Which search method will expand the node a) Best-first search 1
b) Greedy
that is closest to the goal? b) Greedy best-first search
Medium 2 best-first
c) A* search
search
37 The traveling salesman problem involves n a) O(n) 1 Hard 4 c) O(n!)
cities with paths connecting the cities. The b) O(n2)
time taken for traversing through all the c) O(n!)
d) O(n/2)
cities, without knowing in advance the

Correct
No. ) Answer
. s
length of a minimum tour, is ___________
38 Knowledge may be a) Only (I) 1
I. Declarative. b) Only (II) d) Both (I)
c) Only (III) Medium 2
II. Procedural. and (II)
d) Both (I) and (II)
III. Non-procedural.
39 Idempotency law is a) Only (I) 1
I. P Ú P = P. b) Only (II)
c) Only (III) Hard 3 a) Only (I)
II. P Ù P = P.
d) Both (I) and (II)
III. P + P = P.
40 Which value is assigned to alpha and beta
a) Alpha = max 1
in the alpha-beta pruning? b) Beta = min d) Both Alpha
c) Beta = max Hard 3 = max & Beta
d) Both Alpha = max & Beta = = min
min
41 How the effectiveness of the alpha-beta a) Depends on the nodes 1
pruning gets increased? b) Depends on the order in
a) Depends
which they are executed Medium 2
on the nodes
42 A* algorithm is based on __________ A. Breadth-First-Search 1
B. Depth-First-Search D. Best-First-
Medium 2
C. Uniform Cost Search Search
D. Best-First-Search
43 Is optimality and completeness exist in A. Yes, Yes 1
bidirectional search algorithm? B. No, Yes
Medium 2 A. Yes, Yes
C. Yes, No
D. No, No

Correct
No. ) Answer
. s
44 When will Hill-Climbing algorithm terminate? A. Stopping criterion met 1
B. Global Min/Max is achieved C. No
C. No neighbor has higher Medium 2 neighbor has
value higher value
D. All of the above
45 What is Time Complexity of Breadth First A. b 1
search algorithm? B. b^d
Hard 5 B. b^d
C. b^2
D. b^b
46 Depth-First Search is implemented in A. LIFO 1
recursion with _______ data structure. B. LILO
Medium 2 A. LIFO
C. FIFO
D. FILO
47 The action of the Simple reflex agent a) Perception history 1
completely depends upon __________ b) Current perception b) Current
Medium 2
c) Learning theory perception
d) Utility functions
48 What among the following is/are the a) Human 1
example of the intelligent agent/agents? b) Robot d) All of the
Medium 2
c) Autonomous Spacecraft mentioned
49 Is Best First Search a searching algorithm a) True 1
b) False
Medium 2 a) True
used in graphs.
50 Which of the following is an example of Best a) A* 1
First Search algorithm? b) B* d) Both A*
Medium 2
c) C* and B*
d) Both A* and B*

Correct
No. ) Answer
. s
Unit II - Problem Decomposition and Planning
1 The process by which the brain orders a) Planning problem d) Both

actions needed to complete a specific task b) Partial order planning Planning
is referred as ____________ c) Total order planning 2 Medium 2 problem &
d) Both Planning problem & Partial order
Partial order planning planning
2 The famous spare tire problem or a) Planning problem 2 Medium 2 a) Planning
b) Partial Order planning problem
10 | P a g e Army Institute of Technology, Pune

Correct
No. ) Answer
. s
Scheduling classes for bunch of students problem
or Air cargo transport are the best example c) Total order planning
of ____________ d) None of the mentioned
3 To eliminate the inaccuracy problem in a) Stacks 2

planning problem or partial order planning b) Queue
c) BST (Binary Search Tree) d) Planning
problem we can use Medium 3
d) Planning Graphs Graphs
___________________ data structure/s.
4 Planning graphs consists of ____________ a) a sequence of levels 2

b) a sequence of levels which
b) a sequence
corresponds to time steps in
of levels which
the plan
Medium 3 corresponds to
c) a sequence of actions
time steps in
which corresponds to the
the plan
state of the system
d) none of the mentioned
5 Planning graphs works only for a) True 2
b) False
Easy 1 a) True
prepositional planning problems.
6 Instead of representing knowledge in a a) Raw Text 2
relatively declarative, static way (as a b) A bunch of rules
bunch of things that are true), rule-based c) Summarized Text
d) Collection of various Texts b) A bunch of
system represent knowledge in terms Hard 3
rules
of___________ that tell you what you
should do or what you could conclude in
different situations.

Correct
No. ) Answer
. s
7 A rule-based system consists of a bunch of a) True 2
b) False
Easy 1 a) True
IF-THEN rules.
8 In a backward chaining system you start a) True 2
with the initial facts, and keep using the b) False
rules to draw new conclusions (or take Medium 2 b) False
certain actions) given those facts.
9 In a backward chaining system, you start a) True 2

with some hypothesis (or goal) you are b) False
trying to prove, and keep looking for rules
that would allow you to conclude that Medium 2 a) True
hypothesis, perhaps setting new sub-goals
to prove as you go.
10 Forward chaining systems are a) Goal-driven, goal-driven 2

_____________ where as backward b) Goal-driven, data-driven c) Data-driven,
Medium 2
chaining systems are ___________ c) Data-driven, goal-driven goal-driven
d) Data-driven, data-driven
11 A Horn clause is a clause with _______ a) At least one 2
positive literal. b) At most one
Medium 2 b) At most one
c) None
d) All
12 ___________ trees can be used to infer in a) Min/Max Tree 2
Horn clause systems. b) And/Or Trees b) And/Or
Medium 2
c) Minimum Spanning Trees Trees
d) Binary Search Trees

Correct
No. ) Answer
. s
13 An expert system is a computer program a) True 2
that contains some of the subject-specific b) False
Medium 2 a) True
knowledge of one or more human experts.
14 A knowledge engineer has the job of a) True 2

extracting knowledge from an expert and b) False
building the expert system knowledge Medium 2 a) True
base.
15 What is the main task of a problem-solving a) Solve the given problem 2

agent? and reach to goal
b) To find out which sequence
c) All of the
of action will get it to the goal Medium 2
mentioned
state
16 What is state space? a) The whole problem 2
d)
b) Your Definition to a
Representing
problem
Medium 2 your problem
c) Problem you design
with variable
d) Representing your problem
and parameter
with variable and parameter
17 The problem-solving agent with several a) True 2 Medium 3 a) True
immediate options of unknown value can b) False
decide what to do by just examining
different possible sequences of actions that

Correct
No. ) Answer
. s
lead to states of known value, and then
choosing the best sequence. This process
of looking for such a sequence is called
Search.
18 A search algorithm takes _________ as an a) Input, output 2

input and returns ________ as an output. b) Problem, solution
b) Problem,
c) Solution, problem Hard 3
solution
d) Parameters, sequence of
actions
19 A problem in a search space is defined by a) Initial state 2
one of these states. b) Last state
Medium 2 a) Initial state
c) Intermediate state
20 The Set of actions for a problem in a state a) Intermediate states 2 c) Successor
space is formulated by a ___________ b) Initial state function, which
c) Successor function, which takes current
takes current action and Medium 2 action and
returns next immediate state returns next
d) None of the mentioned immediate
state
21 A solution to a problem is a path from the a) True 2
initial state to a goal state. Solution quality b) False
is measured by the path cost function, and
Medium 2 a) True
an optimal solution has the highest path
cost among all solutions.

Correct
No. ) Answer
. s
22 The process of removing detail from a a) Extraction 2
given state representation is called ______ b) Abstraction
Medium 2 b) Abstraction
c) Information Retrieval
d) Mining of data
23 A problem solving approach works well for a) 8-Puzzle problem 2
______________ b) 8-queen problem
c) Finding a optimal path from d) Mars Hover
a given source to a Hard 3 (Robot
destination Navigation)
d) Mars Hover (Robot
Navigation)
24 The _______ is a touring problem in which a) Finding shortest path 2
each city must be visited exactly once. The between a source and a
aim is to find the shortest tour. destination
b) Travelling Salesman b) Travelling
problem Hard 3 Salesman
c) Map coloring problem problem
d) Depth first search traversal
on a given map represented
as a graph
25 Web Crawler is a/an ____________ a) Intelligent goal-based 2
agent a) Intelligent
b) Problem-solving agent Medium 2 goal-based
c) Simple reflex agent agent
d) Model based agent
26 What is the major component/components a) Completeness 2 Hard 3 d) All of the
for measuring the performance of problem b) Optimality mentioned
solving? c) Time and Space

Correct
No. ) Answer
. s
complexity
27 A production rule consists of a) A set of Rule 2
____________ b) A sequence of steps
c) Set of Rule
c) Set of Rule & sequence of
Hard 3 & sequence of
steps
steps
d) Arbitrary representation to
problem
28 Which search method takes less memory? a) Depth-First Search 2
b) Breadth-First search a) Depth-First
Hard 3
c) Linear Search Search
d) Optimal search
29 Which is the best way to go for Game a) Linear approach 2 b) Heuristic
playing problem? b) Heuristic approach (Some approach
knowledge is stored) Hard 3 (Some
c) Random approach knowledge is
d) An Optimal approach stored)
30 In how many directions do queens attack a) 1 2
each other? b) 2
Medium 2 c) 3
c) 3
d) 4
31 Placing n-queens so that no two queens a) n-queen’s problem 2
attack each other is called? b) 8-queen’s problem a) n-queen’s
Medium 2
c) Hamiltonian circuit problem problem
d) subset sum problem
32 Where is the n-queens problem a) carom 2 Hard 3 b) chess
implemented? b) chess
c) ludo

Correct
No. ) Answer
. s
d) cards
33 Not more than 2 queens can occur in an n- a) true 2
queens problem. b) false Medium 2 b) false
34 In n-queen problem, how many values of n a) 1 2

does not provide an optimal solution? b) 2
Hard 4 b) 2
c) 3
d) 4
35 Which of the following methods can be a) greedy algorithm 2
used to solve n-queen’s problem? b) divide and conquer
Medium 2 d) backtracking
c) iterative improvement
d) backtracking
36 Of the following given options, which one of a) (3,1,4,2) 2
the following is a correct option that b) (2,3,1,4)
provides an optimal solution for 4-queens c) (4,3,2,1) Hard 4 a) (3,1,4,2)
d) (4,2,3,1)
problem?
37 How many possible solutions exist for an 8- a) 100 2

queen problem? b) 98
Hard 5 c) 92
c) 92
d) 88
38 How many possible solutions occur for a a) 850 2
10-queen problem? b) 742
Hard 4 d) 724
c) 842
d) 724
39 If n=1, an imaginary solution for the a) true 2
b) false
Medium 2 b) false
problem exists.

Correct
No. ) Answer
. s
40 What is the domination number for 8- a) 8 2
queen’s problem? b) 7
Hard 3 d) 5
c) 6
d) 5
41 Of the following given options, which one of a) (5,3,8,4,7,1,6,2) 2
the following does not provides an optimal b) (1,6,3,8,3,2,4,7) b)
c) (4,1,5,8,6,3,7,2) Hard 5 (1,6,3,8,3,2,4,7
solution for 8-queens problem? )
d) (6,2,7,1,4,8,5,3)
42 Which of the problems cannot be solved by a) n-queen problem 2
backtracking method? b) subset sum problem d) travelling
c) hamiltonian circuit problem Medium 3 salesman
d) travelling salesman problem
problem
43 Backtracking algorithm is implemented by a) State-space tree 2
constructing a tree of choices called as? b) State-chart tree a) State-space
Medium 2
c) Node tree tree
d) Backtracking tree
44 A node is said to be ____________ if it has a) Non-promising 2
a possibility of reaching a complete b) Promising
c) Succeeding Medium 2 b) Promising
solution.
d) Preceding
45 The process by which the brain a) Planning problem 2
incrementally orders actions needed to b) Partial order planning
c) Total order planning b) Partial order
complete a specific task is referred as Hard 3
d) Both Planning problem & planning
______________
Partial order planning
46 To complete any task, the brain needs to a) True 2 Medium 2 a) True

Correct
No. ) Answer
. s
plan out the sequence by which to execute b) False
the behavior. One way the brain does this
is with a partial-order plan.
47 In partial order plan. a) A is true 2

A. Relationships between the actions of the b) B is true
behavior are set prior to the actions c) Either A or B can be true
depending upon situation
B. Relationships between the actions of the
d) Neither A nor B is true Medium 2 a) A is true
behavior are not set until absolutely
necessary
Choose the correct option.
48 What are you predicating by the logic: ۷ x: a) Everyone is loyal to 2

€y: loyalto(x, y). someone
a) Everyone is
b) Everyone is loyal to all
Hard 3 loyal to
c) Everyone is not loyal to
someone
someone
d) Everyone is loyal
49 plan that describe how to take actions in a) Problem solving 2
levels of increasing refinement and b) Planning d) Hierarchical
c) Non-hierarchical plan Medium 2
specificity is ____________ plan
d) Hierarchical plan
50 Uncertainty arises in the Wumpus world a) Full & Global information 2 Hard 3 c) Partial &
because the agent’s sensors give only b) Partial & Global local
____________ Information Information
c) Partial & local Information

Correct
No. ) Answer
. s
d) Full & local information

No Description Question Choices t (Easy/Medium/Hard Level Correct Answer
. No. ) s
Unit III - Logic and Reasoning
1 Knowledge and reasoning also play a a) Completely Observable

crucial role in dealing with b) Partially Observable
__________________ environment. c) Neither Completely nor b) Partially
3 Medium 2
Partially Observable Observable
d) Only Completely and
Partially Observable
2 Treatment chosen by doctor for a patient a) Only current symptoms 3
for a disease is based on _____________ b) Current symptoms plus c) Current
some knowledge from the symptoms plus
textbooks some
Medium 3
c) Current symptoms plus knowledge from
some knowledge from the the textbooks
textbooks plus experience plus experience
3 A knowledge-based agent can combine a) True 3 Medium 2 a) True

. No. ) s
general knowledge with current percepts b) False
to infer hidden aspects of the current state
prior to selecting actions.
4 A) Knowledge base (KB) is consists of set a) A is true, B is true 3

of statements. b) A is false, B is false
B) Inference is deriving a new sentence c) A is true, B is false a) A is true, B is
d) A is false, B is true Medium 2 true
from the KB.
5 Wumpus World is a classic problem, best a) Single player Game 3

example of _______ b) Two player Game
c) Reasoning
c) Reasoning with Medium 3
with Knowledge
Knowledge
d) Knowledge based Game
6 ‘α |= β ‘(to mean that the sentence α a) True, true 3
entails the sentence β) if and only if, in b) True, false
every model in which α is _____ β is also c) False, true Hard 4 a) True, true
d) False, false
_____
7 Which is not a property of representation a) Representational 3

of knowledge? Verification
a)
b) Representational
Medium 2 Representationa
Adequacy
l Verification
c) Inferential Adequacy
d) Inferential Efficiency

. No. ) s
8 Which is not Familiar Connectives in First a) and 3
Order Logic? b) iff
Medium 2 d) not
c) or
d) not
9 Inference algorithm is complete only if a) It can derive any sentence 3
d) It can derive
_____________ b) It can derive any sentence
any sentence
that is an entailed version
that is an
c) It is truth preserving Hard 3
entailed version
d) It can derive any sentence
& It is truth
that is an entailed version & It
preserving
is truth preserving
10 An inference algorithm that derives only a) True 3
entailed sentences is called sound or truth- b) False
Medium 2 a) True
preserving.
11 Which algorithm will work backward from a) Forward chaining 3

the goal to solve a problem? b) Backward chaining b) Backward
Medium 2
c) Hill-climb algorithm chaining
12 Which is mainly used for automated a) Backward chaining 3
reasoning? b) Forward chaining c) Logic
Medium 2
c) Logic programming programming
d) Parallel programming
13 What will backward chaining algorithm will a) Additional statements 3
return? b) Substitutes matching the b) Substitutes
query Medium 2 matching the
c) Logical statement query

. No. ) s
14 How can be the goal is thought of in a) Queue 3
backward chaining algorithm? b) List
Medium 2 d) Stack
c) Vector
d) Stack
15 What is used in backward chaining a) Conjuncts 3
algorithm? b) Substitution c) Composition
Medium 2
c) Composition of substitution of substitution
16 Which algorithm are in more similar to a) Depth-first search 3
backward chaining algorithm? algorithm
b) Breadth-first search
a) Depth-first
algorithm Medium 2
search algorithm
c) Hill-climbing search
algorithm
17 Which problem can frequently occur in a) Repeated states 3
d) Both
backward chaining algorithm? b) Incompleteness
Repeated states
c) Complexity Medium 2
&
d) Both Repeated states &
Incompleteness
Incompleteness
18 How the logic programming can be a) Variables 3
constructed? b) Expressing knowledge in a b) Expressing
formal language Medium 2 knowledge in a
c) Graph formal language
19 What form of negation does the prolog a) Negation as failure 3 Medium 2 a) Negation as
allows? b) Proposition failure
c) Substitution

. No. ) s
d) Negation as success
20 Which is omitted in prolog unification a) Variable check 3
algorithm? b) Occur check
c) Proposition check Medium 2 b) Occur check
d) Both Occur & Proposition
check
21 Knowledge and reasoning also play a a) Completely Observable 3
crucial role in dealing with b) Partially Observable
__________________ environment. c) Neither Completely nor b) Partially
Medium 2
Partially Observable Observable
d) Only Completely and
Partially Observable
22 Treatment chosen by doctor for a patient a) Only current symptoms 3
for a disease is based on _____________ b) Current symptoms plus c) Current
some knowledge from the symptoms plus
textbooks some
Medium 2
c) Current symptoms plus knowledge from
some knowledge from the the textbooks
textbooks plus experience plus experience
23 A knowledge-based agent can combine a) True 3
general knowledge with current percepts b) False
to infer hidden aspects of the current state Medium 3 a) True
prior to selecting actions.
24 A) Knowledge base (KB) is consists of set a) A is true, B is true 3 Hard 3 a) A is true, B is

of statements. b) A is false, B is false true

. No. ) s
B) Inference is deriving a new sentence c) A is true, B is false
from the KB. d) A is false, B is true
25 Wumpus World is a classic problem, best a) Single player Game 3

example of _______ b) Two player Game
c) Reasoning
c) Reasoning with Medium 2
with Knowledge
Knowledge
d) Knowledge based Game
26 Which is not a property of representation a) Representational 3
of knowledge? Verification
a)
b) Representational
Medium 2 Representationa
Adequacy
l Verification
c) Inferential Adequacy
d) Inferential Efficiency
27 Which is not Familiar Connectives in First a) and 3
Order Logic? b) iff
Medium 2 d) not
c) or
d) not
28 Inference algorithm is complete only if a) It can derive any sentence 3
d) It can derive
_____________ b) It can derive any sentence
any sentence
that is an entailed version
that is an
c) It is truth preserving Medium 2
entailed version
d) It can derive any sentence
& It is truth
that is an entailed version & It
preserving
is truth preserving
29 An inference algorithm that derives only a) True 3 Medium 2 a) True
b) False

. No. ) s
entailed sentences is called sound or truth-
preserving.
30 Translate the following statement into a) ∀ a philosopher(a) 3

FOL. scholar(a)
a) ∀ a
“For every a, if a is a philosopher, then a is b) ∃ a philosopher(a)
Hard 4 philosopher(a)
a scholar” scholar(a)
scholar(a)
31 A _________ is used to demonstrate, on a a) Deductive Systems 3
purely syntactic basis, that one formula is b) Inductive Systems
a) Deductive
a logical consequence of another formula. c) Reasoning with Medium 3
Systems
Knowledge Based Systems
d) Search Based Systems
32 The statement comprising the limitations of a) Expressiveness 3
FOL is/are ____________ b) Formalizing Natural
d) All of the
Languages Hard 3
mentioned
c) Many-sorted Logic
33 A common convention is: a) True 3
• is evaluated first b) False
• and are evaluated next
Medium 2 a) True
• Quantifiers are evaluated next
• is evaluated last.
34 A Term is either an individual constant (a a) True 3 Hard 4 a) True

0-ary function), or a variable, or an n-ary b) False

. No. ) s
function applied to n terms: F(t1 t2 ..tn).
35 First Order Logic is also known as a) First Order Predicate 3

___________ Calculus
d) All of the
b) Quantification Theory Medium 2
mentioned
c) Lower Order Calculus
36 The adjective “first-order” distinguishes a) Representational 3
first-order logic from ___________ in Verification
which there are predicates having b) Representational
Adequacy c) Higher Order
predicates or functions as arguments, or in Hard 3
c) Higher Order Logic Logic
which one or both of predicate quantifiers d) Inferential Efficiency
or function quantifiers are permitted.
37 Which is created by using single a) Complex sentences 3

propositional symbol? b) Atomic sentences b) Atomic
Medium 2
c) Composition sentences sentences
38 Which is used to construct the complex a) Symbols 3
sentences? b) Connectives c) Logical
Medium 2
c) Logical connectives connectives
39 How many proposition symbols are there a) 1 3
in artificial intelligence? b) 2
Medium 2 b) 2
c) 3
d) 4
40 Which is used to compute the truth of any a) Semantics of propositional 3 Hard 3 a) Semantics of

. No. ) s
sentence? logic
b) Alpha-beta pruning
c) First-order logic propositional
d) Both Semantics of logic
propositional logic & Alpha-
beta pruning
41 Which are needed to compute the logical a) Logical equivalence 3
inference algorithm? b) Validity d) All of the
Medium 2
c) Satisfiability mentioned
42 From which rule does the modus ponens a) Inference rule 3
are derived? b) Module rule
c) Both Inference & Module Medium 2 a) Inference rule
rule
43 Which is also called single inference rule? a) Reference 3
b) Resolution
b) Resolution
c) Reform
44 Which form is called as a conjunction of a) Conjunctive normal form 3
disjunction of literals? b) Disjunctive normal form Hard 3
a) Conjunctive
c) Normal form normal form
45 What can be viewed as a single lateral of a) Multiple clause 3
disjunction? b) Combine clause
Medium 2 c) Unit clause
c) Unit clause
46 What is the frame? a) A way of representing 3 Medium 2 a) A way of

. No. ) s
knowledge
b) Data Structure representing
c) Data Type knowledge
47 Which of the following elements a) Facts or Data 3
constitutes the frame structure? b) Procedures and default
values
Medium 2 a) Facts or Data
c) Frame names
d) Frame reference in
hierarchy
48 What is Hyponymy relation? a) A is part of B 3
b) B has A as a part of itself c) A is
Medium 2
c) A is subordinate of B subordinate of B
d) A is superordinate of B
49 There exists two way to infer using 3
semantic networks in which knowledge is 1) Intersection Search
represented as Frames. 2) Inheritance Search 1) Intersection
a) True Search
b) False
50 What kind of clauses are available in a) Disjunction of literals 3
Conjunctive Normal Form? b) Disjunction of variables a) Disjunction of
Medium 2
c) Conjunction of literals literals
d) Conjunction of variables

AIR 3 Units MCQ

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

AIR 3 Units MCQ

Uploaded by

Copyright:

Available Formats

Name of Faculty: Prof.

1 Which of the following contains the output a) Printed language and

1|Page Army Institute of Technology, Pune

2|Page Army Institute of Technology, Pune

3|Page Army Institute of Technology, Pune

4|Page Army Institute of Technology, Pune

5|Page Army Institute of Technology, Pune

6|Page Army Institute of Technology, Pune

7|Page Army Institute of Technology, Pune

8|Page Army Institute of Technology, Pune

9|Page Army Institute of Technology, Pune

1 The process by which the brain orders a) Planning problem d) Both

10 | P a g e Army Institute of Technology, Pune

3 To eliminate the inaccuracy problem in a) Stacks 2

4 Planning graphs consists of ____________ a) a sequence of levels 2

11 | P a g e Army Institute of Technology, Pune

9 In a backward chaining system, you start a) True 2

10 Forward chaining systems are a) Goal-driven, goal-driven 2

12 | P a g e Army Institute of Technology, Pune

14 A knowledge engineer has the job of a) True 2

15 What is the main task of a problem-solving a) Solve the given problem 2

13 | P a g e Army Institute of Technology, Pune

18 A search algorithm takes _________ as an a) Input, output 2

14 | P a g e Army Institute of Technology, Pune

15 | P a g e Army Institute of Technology, Pune

16 | P a g e Army Institute of Technology, Pune

34 In n-queen problem, how many values of n a) 1 2

37 How many possible solutions exist for an 8- a) 100 2

17 | P a g e Army Institute of Technology, Pune

18 | P a g e Army Institute of Technology, Pune

47 In partial order plan. a) A is true 2

48 What are you predicating by the logic: ۷ x: a) Everyone is loyal to 2

19 | P a g e Army Institute of Technology, Pune

Name of Faculty: Prof. Sagar Rane

1 Knowledge and reasoning also play a a) Completely Observable

20 | P a g e Army Institute of Technology, Pune

4 A) Knowledge base (KB) is consists of set a) A is true, B is true 3

5 Wumpus World is a classic problem, best a) Single player Game 3

7 Which is not a property of representation a) Representational 3

21 | P a g e Army Institute of Technology, Pune

11 Which algorithm will work backward from a) Forward chaining 3

22 | P a g e Army Institute of Technology, Pune

23 | P a g e Army Institute of Technology, Pune

24 A) Knowledge base (KB) is consists of set a) A is true, B is true 3 Hard 3 a) A is true, B is

24 | P a g e Army Institute of Technology, Pune

25 Wumpus World is a classic problem, best a) Single player Game 3

25 | P a g e Army Institute of Technology, Pune

30 Translate the following statement into a) ∀ a philosopher(a) 3

34 A Term is either an individual constant (a a) True 3 Hard 4 a) True

26 | P a g e Army Institute of Technology, Pune

35 First Order Logic is also known as a) First Order Predicate 3

37 Which is created by using single a) Complex sentences 3

27 | P a g e Army Institute of Technology, Pune

28 | P a g e Army Institute of Technology, Pune

29 | P a g e Army Institute of Technology, Pune

You might also like