M.C.A. (Science) (Semester (CGPA) Examination, 2017
ARTIFICIAL INTELLIGENCE
Day Date: Tuesday, 18-04-2017 Max. Marks: 70
Time: 10:30 AM to 01.00 PM
N.B. Q.1 and Q2 are compulsory Questions.
Attempt any Three Questions from Q .No 3 to No.7
Figures to the Right indicate full marks.
Q.1 Choose the correct alternatives: 10
which can be applied to several commonsense tasks
as well as to the problem of performing symbolic manipulations
of logical expression.
Specific Problem Solver General Problem Solver
Principa Mathematica Simple Problem Solver
Specify one or more states within that space describe possible
situations from which the problem solving process may start.
These are
Problem state Initial state
Solution state Goal state
Depth First Search requires memory since only the
nodes on the current path are stored.
Maximum Less Too large Not less
is a flat area of search space in which a whole set of
neighboring states has the same value.
Plateau Local maxima Ridge Foothills
A straight forward procedure to solve Crypt-arithmetic Problem
might operate in a state space of partial solutions in which
are assigned particular number as their values.
Digits Figures Sentences Letters
The predicate instance is a binary one, whose first argument is
object and whose second argument is to which object
belongs.
variable Token Class Abstract
are a natural way to represent relationship that would
as ground instances of binary predicates in predicate logic.
Resolution Proposition Logic
Semantic Net Frame
ELIZA an early AI program that simulated the of
Rogerian therapist.
Actionable Divisional Behavioral Physical
Page 1 of 2
SLR-K 44
The primitive acts for transfer of physical location of an
object.
MOVE PTRANS ATRANS INGEST
10) In analysis, the structures created by the syntactic
analyzer are assigned meanings.
Syntactic Pragmatic Semantic d)morphological
State True or False. 04
First three decades of AI research is that intelligence requires
inspiration.
A well defined computable function can play an important part in
efficiently guiding a search process toward a solution.
User can search forward through the state space from the start
to a goal state.
RETE remembers its previous calculations and is able to merge
new binding's information efficiently.
Q.2. Write a short note 08
i. Production System
ii.Artificial Intelligence
Answer the following: 06
i. State and describe Bayes' Theorem.
ii.What do you mean by knowledge Representation?
Q.3 Answer the following:
Define logic as Predicate logic. Discuss the concept of Natural
deduction with suitable example.
07
Define the term cut- off or pruning? Discuss the procedure for
adding Alpha-Beta cut-off with suitable example.
07
Q.4 Answer the following:
What do you by Best First Search? Explain Best First Search as a
part of Heuristic Search technique with suitable example.
07
What do you mean by Reasoning? Explain in detail the four factor
influence to decide a better kind of reasoning?
07
Q.5 Answer the following
What are the different kinds of question as issues in knowledge
representation needs to be addressed?
07
Define the term Probability. State and explain in detail
Dempster-Shafer Theory with suitable example.
07
Q.6 Answer the following
Explain in detail steps of Syntactic Processing as the process of
Natural Language Processing with suitable example?
07
Explain in detail the concept of Conceptual Dependency as strong
slot and filler structure with suitable example?
07
Q.7 Answer the following
Discuss in detail various task domains of Artificial Intelligence as
the target of work in it.
07
Explain in detail process of Explanation and Knowledge
acquisition as a part of Expert System?