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
and Theorem proving share the property, people who
do them well are considered to be displaying intelligence.
Mathematical Algebra Game Playing
Natural Language Breadth First search
provides a way of solving problems for which no more
direct approach is available as well as framework into which any direct
techniques that are available can be embedded.
Generalization Specialization
Abstraction Search
The problem can be solved by using in combination
with an appropriate control strategy, to move through the problem
space.
Pointers Initial state
Rules Goal state
A good general purpose heuristic that is useful for variety
problems in nearest neighbor heuristics, which work by selecting the
locally superior alternative at each step.
Sequential Combinatorial
Parallel Chronological
The is useful for the representation of problems that can
be solved by decomposing them into a set of smaller problems, all of
which must then be solved.
X-OR Graph AND-OR Graph
OR Graph AND Graph
The sentence "All citizens were either faithful to King or hated
him" would be represented using predicate logic as
→
→

→
represents a lower bound on the value that a maximizing
node may ultimately be assigned.
Beta Alpha
Gamma Branch and Bound
Page 2 of 3
SLR-MG-307
For script, it may be sufficient merely to store a pointer
to the script so that it can be accessed later if necessary.
Emotional
Fleeting
Non-fleeting
Pointer
rules encode knowledge about how to response to
certain input configurations.
Backward Sequential
Forward Both a and b
10) is a program that provides advice on mineral
exploration.
MYCIN ELIZA
DENDRAL PROSPECTOR
State True or False. 04
A biological symbol system has necessary and sufficient means for
general intelligent action.
The requirement conceptual dependency is that it should cause
motion in the solution space.
Most diagnostic tasks, including medical diagnosis as well as
diagnosis of faults in mechanical devices are example of classification.
All the conjuncts will be considered to be conjoined together as the
proof procedure operates.
Q.2 Write short notes of the following. 08
A 1 Technique
Knowledge Acquisition
Answer the following 06
What do you mean by Fuzzy Logic?
What do you mean by Frames?
Q.3 Answer the following.
What do you mean by Resolution? Discuss in detail an algorithm of
Conjunctive Normal Form.
07
What do you mean by Game Theory? Explain MinMax Search Procedure
with suitable example?
07
Q.4 Answer the following.
What do you mean by Heuristic search? Discuss problems by which Hill
climbing may get fail to find solution.
07
What do you mean by Matching? Discuss in detail various types of
proposal for Matching
07
Q.5 Answer the following.
What do you mean Knowledge representation? Explain various
approaches of representing it with suitable example?
07
State the approaches of Statistical Reasoning. Explain the Certainty factor
and Rule based system in detail.
07
Q.6 Answer the following.
Define the term semantic Net. Explain in detail the concept of Semantic
net as weal slot and filter structure?
07
What do you mean by Natural Language Processing? State and explain
steps of Natural Language Processing with suitable example?
07
Page 3 of 3
SLR-MG-307
Q.7 Answer the following.
Define Artificial Intelligence. Discuss the concept of Constraint
Satisfaction used to solve below crypt-arithmetic problem.
S E N D
M O R E

M O N E YM.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
and Theorem proving share the property, people who
do them well are considered to be displaying intelligence.
Mathematical Algebra Game Playing
Natural Language Breadth First search
provides a way of solving problems for which no more
direct approach is available as well as framework into which any direct
techniques that are available can be embedded.
Generalization Specialization
Abstraction Search
The problem can be solved by using in combination
with an appropriate control strategy, to move through the problem
space.
Pointers Initial state
Rules Goal state
A good general purpose heuristic that is useful for variety
problems in nearest neighbor heuristics, which work by selecting the
locally superior alternative at each step.
Sequential Combinatorial
Parallel Chronological
The is useful for the representation of problems that can
be solved by decomposing them into a set of smaller problems, all of
which must then be solved.
X-OR Graph AND-OR Graph
OR Graph AND Graph
The sentence "All citizens were either faithful to King or hated
him" would be represented using predicate logic as
→
→

→
represents a lower bound on the value that a maximizing
node may ultimately be assigned.
Beta Alpha
Gamma Branch and Bound
Page 2 of 3
SLR-MG-307
For script, it may be sufficient merely to store a pointer
to the script so that it can be accessed later if necessary.
Emotional
Fleeting
Non-fleeting
Pointer
rules encode knowledge about how to response to
certain input configurations.
Backward Sequential
Forward Both a and b
10) is a program that provides advice on mineral
exploration.
MYCIN ELIZA
DENDRAL PROSPECTOR
State True or False. 04
A biological symbol system has necessary and sufficient means for
general intelligent action.
The requirement conceptual dependency is that it should cause
motion in the solution space.
Most diagnostic tasks, including medical diagnosis as well as
diagnosis of faults in mechanical devices are example of classification.
All the conjuncts will be considered to be conjoined together as the
proof procedure operates.
Q.2 Write short notes of the following. 08
A 1 Technique
Knowledge Acquisition
Answer the following 06
What do you mean by Fuzzy Logic?
What do you mean by Frames?
Q.3 Answer the following.
What do you mean by Resolution? Discuss in detail an algorithm of
Conjunctive Normal Form.
07
What do you mean by Game Theory? Explain MinMax Search Procedure
with suitable example?
07
Q.4 Answer the following.
What do you mean by Heuristic search? Discuss problems by which Hill
climbing may get fail to find solution.
07
What do you mean by Matching? Discuss in detail various types of
proposal for Matching
07
Q.5 Answer the following.
What do you mean Knowledge representation? Explain various
approaches of representing it with suitable example?
07
State the approaches of Statistical Reasoning. Explain the Certainty factor
and Rule based system in detail.
07
Q.6 Answer the following.
Define the term semantic Net. Explain in detail the concept of Semantic
net as weal slot and filter structure?
07
What do you mean by Natural Language Processing? State and explain
steps of Natural Language Processing with suitable example?
07
Page 3 of 3
SLR-MG-307
Q.7 Answer the following.
Define Artificial Intelligence. Discuss the concept of Constraint
Satisfaction used to solve below crypt-arithmetic problem.
S E N D
M O R E

M O N E Y
07
Define the term Expert System. Discuss in detail solution of water jug
problem with suitable example.
07
Define the term Expert System. Discuss in detail solution of water jug
problem with suitable example.