M.Sc. (Semester III) (CBCS) Examination Oct/Nov-2017
Computer Science
ARTIFICIAL INTELLIGENCE
Day Date: Tuesday, 21-11-2017 Max. Marks: 70
Time: 02.30 PM to 05.00 PM
Instructions: Question no. 1 and 2 are compulsory.
Attempt any 3 questions from Q. no. 3 to Q. no. 7
Figures to the right indicate full marks.
Q.1 Choose correct alternatives. 10
Discourse Integration is used to state the meaning of an individual
sentence that may depend on the sentences that precede it and may
influence the meaning of the sentences that it.
Head Follow
Precede None of these
Measure of disbelief measures the extent to which the
supports the negation of the hypothesis.
Membership function Evidence
Cutoffs Hill climbing
is a structure that describes a stereotyped sequence of
events in a particular context.
Semantic Net Script
Bayesian Network Frames
attempts to show that the negation of the statement
produces a contradiction with the known statements.
Iterative deepening Resolution
Problem reduction System shells
stores the rules so that they share structures in
memory; set of conditions that appear in several rules are matched
once per cycle.
MYCIN SALT
RETE TEIRESIAS
task belongs to the domain for Formal task.
Engineering Mathematic
Financial analysis Robot control
The instance is a binary one, whose first argument is
an object and whose second argument is a class to which the object
belongs.
Natural deduction Predicate
Computable Resolution
The means-ends analysis process centers for the detection of
difference between the state and the goal state.
Main
Original
Start
Page 2 of 2
SLR-MG-302
Current
search requires less memory since only the nodes on
the current path are stored.
Breadth first search Linear search
Depth first search Binary search
10) A physical symbol system has the necessary and sufficient means for
general action.
Inactive Active
Intelligent Logical
State True or False. 04
Sometime very simple heuristic functions can provide a fairly good
estimate of whether a path is good or not.
We can search forward through state space from goal state to a start
state.
Non-monotonic, partially commutative systems are useful for solving
ignorable problems.
In a semantic net, information is represented as a set of nodes
connected to each other by a set of labeled arcs, which represent
relationship among the nodes.
Q.2 Write short notes of the following. 08
Certainty Factor
Matching
Answer the following:- 06
Define the term Predict Logic?
What do you mean by reasoning?
Q.3 Answer the following.
What is MYCIN? Explain in detail expert system shell and process of
explanation needed in expert system?
07
Discuss conceptual dependency as the strong and filter structure with
suitable example.
07
Q.4 Answer the following.
What do you mean by Alpha-Beta cutoff? Discuss additional refinements
to the min-max procedure to improve performance.
07
Discuss in detail process of Syntactic processing using grammars and
parser with suitable example.
07
Q.5 Answer the following.
What do you mean by frame? Explain in detail frame slots as full-fledged
objects with suitable example?
07
What do you mean by fuzzy logic? Discuss in detail Dempster-Shafer
theory.
07
Q.6 Answer the following.
Discuss Hill climbing and its variation and also situations when hill
climbing may fail to find a solution.
07
Discuss in detail computable functions and predicate with suitable
example.
07
Q.7 Answer the following.
State the meaning of AI techniques. Illustrate water-jug problem with
suitable example?
07
Define the term state space. Discuss in detail different key dimension of
problem as its characteristics.