Q.

Unit Difficulty
Description Question Choices
No. No. (Easy/Medium
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
1 Easy
object
c) Locomotion
d) All of the mentioned
2 LISP was created by? a) John McCarthy
b) Marvin Minsky
c) Alan Turing 1 Medium
d) Allen Newell and Herbert
Simon
3 What is Artificial intelligence? a) Putting your intelligence into
Computer
b) Programming with your own
1 Easy
intelligence
c) Making a Machine intelligent
d) Playing a Game
4 Which search method takes less memory? a) Depth-First Search
b) Breadth-First search
1 Medium
c) Optimal search
d) Linear Search
5 A heuristic is a way of trying __________ a) To discover something or an
idea embedded in a program
b) To search and measure how
far a node in a search tree
seems to be from a goal 1 Medium
c) To compare two nodes in a
search tree to see if one is
better than the other is
d) All of the mentioned
6 The performance of an agent can be a) Learning
improved by __________ b) Observing
1 Medium
c) Perceiving
d) None of the mentioned
7 An Artificial Neural Network Is based on? a) Strong Artificial Intelligence
approach
b) Weak Artificial Intelligence
approach
1 Medium
c) Cognitive Artificial
Intelligence 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
1 Medium
c) Construction of plans in real
time dynamic systems
d) All of the mentioned
9 What among the following is/are the example a) Human 1
of the intelligent agent/agents? b) Robot
Medium
c) Autonomous Spacecraft
d) All of the mentioned
10 Which is the most straightforward approach a) Best-first search 1
for planning algorithm? b) State-space search
Medium
c) Depth-first search
d) Hill-climbing search
11 What are taken into account of state-space a) Postconditions 1
search? b) Preconditions
Medium
c) Effects
d) Both Preconditions & Effects
12 How many ways are available to solve the a) 1 1
state-space search? b) 2
Medium
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
surroundings and uses its Medium
intelligence and performs the
desired operations
c) A embedded program
controlling line following robot
d) All of the mentioned
14 Rational agent is the one who always does a) True 1
b) False Medium
the right thing.
15 Categorize Crossword puzzle in Fully a) Fully Observable 1
Observable / Partially Observable. b) partially Observable
Medium
c) All of the mentioned
d) None of the mentioned
16 The game of Poker is a single agent. a) True 1
Medium
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
Medium
c) Level-order 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
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
c) Linked List
d) Tree
20 A person wants to visit some places. He a) Depth First Search 1 Medium
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
d) Kruskal’s Algorithm
backtracks and then explore other vertex
from same vertex. What algorithm he should
 use?
21 Which are necessary for an agent to solve an a) Actions 1
online search problem? b) Step-cost function
Medium
c) Goal-test
d) All of the mentioned
22 Which of the following algorithm is online a) Breadth-first search 1
search algorithm? algorithm
b) Depth-first search algorithm
Medium
c) Hill-climbing search
algorithm
d) None of the mentioned
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
Techniques Medium
c) Local Search 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 Medium
increasing value – that is uphill. c) Hill algorithm
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 neighbor has higher Medium
value
d) All of the mentioned
26 What are the main cons of hill-climbing a) Terminates at local optimum 1
search? & Does not find optimum
solution
b) Terminates at global
optimum & Does not find Medium
optimum solution
c) Does not find optimum
solution & Fail to find a solution
d) Fail to find a solution
27 Hill-Climbing approach stuck for which of the a) Local maxima 1
following reasons? b) Ridges
Hard
c) Plateaux
d) All of the mentioned
28 What are the two main features of Genetic a) Fitness function & 1
Algorithm? Crossover techniques
b) Crossover techniques &
Random mutation
Medium
c) Individuals among the
population & Random mutation
d) Random mutation & Fitness
function
29 Searching using query on Internet is, use of a) Offline agent 1
___________ type of agent. b) Online agent
Medium
c) Both Offline & Online agent
d) Goal Based & Online agent
30 Which search strategy is also called as blind a) Uninformed search 1 Medium
 search? b) Informed search
c) Simple reflex search
d) All of the mentioned
31 When is breadth-first search is optimal? a) When there is less number 1
of nodes
b) When all step costs are
equal Medium
c) When all step costs are
unequal
d) None of the mentioned
32 How many successors are generated in a) 1 1
backtracking search? b) 2
Medium
c) 3
d) 4
33 Which search algorithm imposes a fixed a) Depth-limited search 1
depth limit on nodes? b) Depth-first search
Medium
c) Iterative deepening search
d) Bidirectional search
34 What is the other name of informed search a) Simple search 1
strategy? b) Heuristic search
Medium
c) Online search
d) None of the mentioned
35 What is the heuristic function of greedy best- a) f(n) != h(n) 1
first search? b) f(n) < h(n)
Hard
c) f(n) = h(n)
d) f(n) > h(n)
36 Which search method will expand the node a) Best-first search 1
that is closest to the goal? b) Greedy best-first search
Medium
c) A* search
d) None of the mentioned
37 The traveling salesman problem involves n a) O(n) 1
cities with paths connecting the cities. The b) O(n2)
time taken for traversing through all the c) O(n!) Hard
d) O(n/2)
cities, without knowing in advance the length
of a minimum tour, is ___________
38 Knowledge may be a) Only (I) 1
I. Declarative. b) Only (II)
c) Only (III) Medium
II. Procedural.
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
II. P Ù P = P.
d) Both (I) and (II)
III. P + P = P.
40 a) Alpha = max
Which value is assigned to alpha and beta in 1
the alpha-beta pruning? b) Beta = min
c) Beta = max Hard
d) Both Alpha = max & Beta =
min
41 How the effectiveness of the alpha-beta a) Depends on the nodes 1 Medium
pruning gets increased? b) Depends on the order in
which they are executed
 c) All of the mentioned
d) None of the mentioned
42 A* algorithm is based on __________ A. Breadth-First-Search 1
B. Depth-First-Search
Mediu
C. Uniform Cost Search
D. Best-First-Search
43 Is optimality and completeness exist in A. Yes, Yes 1
bidirectional search algorithm? B. No, Yes
Mediu
C. Yes, No
D. No, No
44 When will Hill-Climbing algorithm terminate? A. Stopping criterion met 1
B. Global Min/Max is achieved
C. No neighbor has higher Mediu
value
D. All of the above
45 What is Time Complexity of Breadth First A. b 1
search algorithm? B. b^d
Hard
C. b^2
D. b^b
46 Depth-First Search is implemented in recursion A. LIFO 1
with _______ data structure. B. LILO
Medium
C. FIFO
D. FILO
47 The action of the Simple reflex agent a) Perception history 1
completely depends upon __________ b) Current perception
Medium
c) Learning theory
d) Utility functions
48 What among the following is/are the example a) Human 1
of the intelligent agent/agents? b) Robot
Medium
c) Autonomous Spacecraft
d) All of the mentioned
49 Is Best First Search a searching algorithm a) True 1
b) False Medium
used in graphs.
50 Which of the following is an example of Best a) A* 1
First Search algorithm? b) B*
Medium
c) C*
d) Both A* and B*
Q. Uni
Difficulty le
No Description Question Choices t
(Easy/Medium
. No.
Unit II - Problem Decomposition and Planning

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

actions needed to complete a specific task is b) Partial order planning
referred as ____________ c) Total order planning 2 Medium
d) Both Planning problem &
Partial order planning
2 The famous spare tire problem or a) Planning problem 2
Scheduling classes for bunch of students or b) Partial Order planning
Air cargo transport are the best example of problem Medium
c) Total order planning
____________ d) None of the mentioned
3 To eliminate the inaccuracy problem in a) Stacks 2
planning problem or partial order planning b) Queue
problem we can use ___________________ c) BST (Binary Search Tree) Medium
d) Planning Graphs
data structure/s.

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

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

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

with some hypothesis (or goal) you are b) False
 trying to prove, and keep looking for rules
that would allow you to conclude that
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
Medium
chaining systems are ___________ c) Data-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
c) None
d) All
12  ___________ trees can be used to infer in a) Min/Max Tree 2
Horn clause systems. b) And/Or Trees
Medium
c) Minimum Spanning Trees
d) Binary Search Trees
13 An expert system is a computer program a) True 2
that contains some of the subject-specific b) False
Medium
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
Medium
building the expert system knowledge 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
of action will get it to the goal Medium
state
c) All of the mentioned
d) None of the mentioned
16 What is state space? a) The whole problem 2
b) Your Definition to a problem
c) Problem you design Medium
d) Representing your problem
with variable and parameter
17 The problem-solving agent with several a) True 2
immediate options of unknown value can b) False
decide what to do by just examining different
possible sequences of actions that lead to
Medium
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
c) Solution, problem Hard
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
c) Intermediate state
d) All of the mentioned
20 The Set of actions for a problem in a state a) Intermediate states 2
space is formulated by a ___________ b) Initial state
c) Successor function, which
Medium
takes current action and
returns next immediate state
d) None of the mentioned
21 A solution to a problem is a path from the a) True 2
initial state to a goal state. Solution quality is b) False
measured by the path cost function, and an
Medium
optimal solution has the highest path cost
among all solutions.

22 The process of removing detail from a given a) Extraction 2

state representation is called ______ b) Abstraction
Medium
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
Hard
a given source to a destination
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
problem Hard
c) Map coloring problem
d) Depth first search traversal
on a given map represented
as a graph
25 Web Crawler is a/an ____________ a) Intelligent goal-based agent 2
b) Problem-solving agent
Medium
c) Simple reflex agent
d) Model based agent
26 What is the major component/components a) Completeness 2
for measuring the performance of problem b) Optimality
c) Time and Space complexity Hard
solving?
d) All of the mentioned
27 A production rule consists of ____________ a) A set of Rule 2
b) A sequence of steps
c) Set of Rule & sequence of
Hard
steps
d) Arbitrary representation to
problem
28 Which search method takes less memory? a) Depth-First Search 2 Hard
b) Breadth-First search
c) Linear Search
 d) Optimal search
29 Which is the best way to go for Game a) Linear approach 2
playing problem? b) Heuristic approach (Some
knowledge is stored) Hard
c) Random approach
d) An Optimal approach
30 In how many directions do queens attack a) 1 2
each other? b) 2
Medium
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
Medium
c) Hamiltonian circuit problem
d) subset sum problem
32 Where is the n-queens problem a) carom 2
implemented? b) chess
Hard
c) ludo
d) cards
33 Not more than 2 queens can occur in an n- a) true 2
queens problem. b) false Medium

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

does not provide an optimal solution? b) 2
Hard
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
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 provides b) (2,3,1,4)
c) (4,3,2,1) Hard
an optimal solution for 4-queens problem?
d) (4,2,3,1)
37 How many possible solutions exist for an 8- a) 100 2
queen problem? b) 98
Hard
c) 92
d) 88
38 How many possible solutions occur for a 10- a) 850 2
queen problem? b) 742
Hard
c) 842
d) 724
39 If n=1, an imaginary solution for the problem a) true 2
b) false Medium
exists.
40 What is the domination number for 8- a) 8 2
queen’s problem? b) 7
Hard
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)
c) (4,1,5,8,6,3,7,2) Hard
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
c) hamiltonian circuit problem Medium
d) travelling salesman problem

43 Backtracking algorithm is implemented by a) State-space tree 2

constructing a tree of choices called as? b) State-chart tree
Medium
c) Node tree
d) Backtracking tree
44 A node is said to be ____________ if it has a) Non-promising 2
a possibility of reaching a complete solution. b) Promising
Medium
c) Succeeding
d) Preceding
45 The process by which the brain a) Planning problem 2
incrementally orders actions needed to b) Partial order planning
complete a specific task is referred as c) Total order planning Hard
d) Both Planning problem &
______________ Partial order planning
46 To complete any task, the brain needs to a) True 2
plan out the sequence by which to execute b) False
the behavior. One way the brain does this is Medium
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
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
b) Everyone is loyal to all
Hard
c) Everyone is not loyal to
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
c) Non-hierarchical plan Medium
specificity is ____________
d) Hierarchical plan
50 Uncertainty arises in the Wumpus world a) Full & Global information 2
because the agent’s sensors give only b) Partial & Global Information
c) Partial & local Information Hard
____________
d) Full & local information
Q. Uni Difficulty lev
No Description Question Choices t (Easy/Medium/
. No. )
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
3 Medium
Partially Observable
d) Only Completely and
Partially Observable
2 Treatment chosen by doctor for a patient for a) Only current symptoms 3
a disease is based on _____________ b) Current symptoms plus
some knowledge from the
textbooks
Medium
c) Current symptoms plus
some knowledge from the
textbooks plus experience
d) All of the mentioned
3 A knowledge-based agent can combine a) True 3
general knowledge with current percepts to b) False
infer hidden aspects of the current state Medium
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
d) A is false, B is true Medium
from the KB.
Choose the correct option.

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

example of _______ b) Two player Game
Medium
c) Reasoning with Knowledge
d) Knowledge based Game
6  ‘α |= β ‘(to mean that the sentence α entails a) True, true 3
the sentence β) if and only if, in every b) True, false
c) False, true Hard
model in which α is _____ β is also _____
d) False, false
7 Which is not a property of representation of a) Representational 3
knowledge? Verification
b) Representational Adequacy Medium
c) Inferential Adequacy
d) Inferential Efficiency
8 Which is not Familiar Connectives in First a) and 3
Order Logic? b) iff
Medium
c) or
d) not
9 Inference algorithm is complete only if a) It can derive any sentence 3 Hard
_____________ b) It can derive any sentence
that is an entailed version
c) It is truth preserving
 d) It can derive any sentence
that is an entailed version & It
is truth preserving
10 An inference algorithm that derives only a) True 3
entailed sentences is called sound or truth- b) False
Medium
preserving.

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

the goal to solve a problem? b) Backward chaining
Medium
c) Hill-climb algorithm
d) None of the mentioned
12 Which is mainly used for automated a) Backward chaining 3
reasoning? b) Forward chaining
Medium
c) Logic programming
d) Parallel programming
13 What will backward chaining algorithm will a) Additional statements 3
return? b) Substitutes matching the
query Medium
c) Logical statement
d) All of the mentioned
14 How can be the goal is thought of in a) Queue 3
backward chaining algorithm? b) List
Medium
c) Vector
d) Stack
15 What is used in backward chaining a) Conjuncts 3
algorithm? b) Substitution
Medium
c) Composition of substitution
d) None of the mentioned
16 Which algorithm are in more similar to a) Depth-first search algorithm 3
backward chaining algorithm? b) Breadth-first search
algorithm
Medium
c) Hill-climbing search
algorithm
d) All of the mentioned
17 Which problem can frequently occur in a) Repeated states 3
backward chaining algorithm? b) Incompleteness
c) Complexity Medium
d) Both Repeated states &
Incompleteness
18 How the logic programming can be a) Variables 3
constructed? b) Expressing knowledge in a
formal language Medium
c) Graph
d) All of the mentioned
19 What form of negation does the prolog a) Negation as failure 3
allows? b) Proposition
Medium
c) Substitution
d) Negation as success
20 Which is omitted in prolog unification a) Variable check 3 Medium
algorithm? b) Occur check
c) Proposition 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
Medium
Partially Observable
d) Only Completely and
Partially Observable
22 Treatment chosen by doctor for a patient for a) Only current symptoms 3
a disease is based on _____________ b) Current symptoms plus
some knowledge from the
textbooks
Medium
c) Current symptoms plus
some knowledge from the
textbooks plus experience
d) All of the mentioned
23 A knowledge-based agent can combine a) True 3
general knowledge with current percepts to b) False
infer hidden aspects of the current state Medium
prior to selecting actions.

24 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
d) A is false, B is true Hard
from the KB.
Choose the correct option.

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

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

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

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

34 A Term is either an individual constant (a 0- a) True 3

ary function), or a variable, or an n-ary b) False
Hard
function applied to n terms: F(t1 t2 ..tn).

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

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

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

propositional symbol? b) Atomic sentences
Medium
c) Composition sentences
d) None of the mentioned
38 Which is used to construct the complex a) Symbols 3
sentences? b) Connectives
Medium
c) Logical connectives
d) All of the mentioned
39 How many proposition symbols are there in a) 1 3
artificial intelligence? b) 2
Medium
c) 3
d) 4
40 Which is used to compute the truth of any a) Semantics of propositional 3 Hard
 sentence? logic
b) Alpha-beta pruning
c) First-order logic
d) Both Semantics of
propositional logic & Alpha-
beta pruning
41 Which are needed to compute the logical a) Logical equivalence 3
inference algorithm? b) Validity
Medium
c) Satisfiability
d) All of the mentioned
42 From which rule does the modus ponens a) Inference rule 3
are derived? b) Module rule
c) Both Inference & Module Medium
rule
d) None of the mentioned
43 Which is also called single inference rule? a) Reference 3
b) Resolution
c) Reform
d) None of the mentioned
44 Which form is called as a conjunction of a) Conjunctive normal form 3
disjunction of literals? b) Disjunctive normal form Hard
c) Normal form
d) All of the mentioned
45 What can be viewed as a single lateral of a) Multiple clause 3
disjunction? b) Combine clause
Medium
c) Unit clause
d) None of the mentioned
46 What is the frame? a) A way of representing 3
knowledge
b) Data Structure Medium
c) Data Type
d) None of the mentioned
47 Which of the following elements constitutes a) Facts or Data 3
the frame structure? b) Procedures and default
values
Medium
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
Medium
c) A is 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
a) True
b) False
50 What kind of clauses are available in a) Disjunction of literals 3
Conjunctive Normal Form? b) Disjunction of variables
Medium
c) Conjunction of literals
d) Conjunction of variables