Master of Computer Application I (Computer Science)
Examination: Oct Nov 2016 Semester V (New CGPA)
SLR No. Day
Date Time Subject Name Paper
No. Seat No.
SLR U
36
Wednesday
16/11/2016
10.30 AM
to
01.00 PM
Artificial Intelligence
C

We Instructions: Question no. 1 2 are compulsory
Attempt any three questions from Q. No. 3 to Q. No. 7
Figures to the right indicate full marks.
Total Marks: 70
Q.1 Choose the correct alternatives 10
AI focused on the sort of problem solving that we do every day when we
decide how to get to work in morning often celled
Scientific Analysis Theorem proving
Commonsense reasoning Depth First search
Specify one or more states that would be acceptable as solutions to the
problem. These states are called.
Problem state Solution state
Goal state Initial state
requires less memory since only the nodes on the current path are
stored.
Breadth First Search Solution space
Depth First Search Problem space
is an area of the search space that is higher than surrounding areas
and that itself has a slope.
Local maxima Ridge O
Plateau Foothills
A straight forward procedure to solve might operate in a state
space of partial solutions in which letters are assigned particular numbers as
their values.
Monkey and Banana problem
Missionaries and Cannibal problem
Crypt-arithmetic problem
Tower of Hanoi problem
The predicate is a binary one, whose first argument is object and
whose second argument is class to which object belongs.
Alpha represents a lower bound on the value that a node may
ultimately be assigned.
Minimizing Maximizing
Leaf Root
an early AI program that simulated the behavioral of Rogerian
therapist.
MYCIN PROSPECTOR
ELIZA DENDRAL
The primitive acts stands for applications of physical location of
an object.
ATTEND MBUILD
PROPEL MOVE
10) In analysis, the structure representing what was said is reinterpreted
to determine what was actually meant.
Semantic Syntactic
Pragmatic Morphological
State True or False: 04
User can search forward through the state space from the start to a goal state.
One efficient many-many match algorithm is RETE.
First three decades of AI research is that intelligence requires color image
processing.
A computable functions is a function that maps from problem state
descriptions to measures of desirability, usually represented as numbers.
Q.2 Write a short note: 08
Baye's theorem
Production System
Answer the following: 06
What do you mean by Artificial Intelligence?
Briefly define the term script
Q.3 Answer the following:
What do you mean by predicate logic? Discuss the applicability of
computable functions and predicates.
What do you mean by cut-off or pruning? State and describe procedure for
adding Alpha-Beta cut-off.
07
07
Q.4 Answer the followings
Discuss the first search as a part of Heuristic search technique with suitable
example.
Define the term reasoning. Discuss the four factor influence to decide a better
kind of reasoning.
07
07
Q.5 Answer the followings
Discuss different kinds of questions as issues in knowledge representation
needs to be addressed?
What do you mean by probability? State and describe Dempster-Shafer
Theory with suitable example.
07
07
Q.6 Answer the following
Discuss in detail steps of semantic Analysis as the process of Natural
Language processing with suitable example.
Discuss in detail the concept of conceptual Dependency as strong slot and
filler structure with suitable example.
07
07
Q.7 Answer the following
Explain in detail various task domain of Artificial Intelligence as the target of
work in it?
State and discuss in detail process of explanation and knowledge acquisition
as a part of Expert system.
07
07