60425
Reg. No.
I
v Semester MCA Degree bAamination, April - 2021
cOMPUTER SCIENCE
Artificial Intelligence
(CBCS Scheme)
Paper MCA 503 TT
Time: 3 Hours Maximum Marks: 70
Instructions to Candidates:
Answer any Five questions from Part A and any Four from PartB
PART-A
Answer any Five questions:
(5x6-30)
Define Artificial Intelligence. Discuss types of Knowledge Representations with example.
2. Explain minimax airategyförganme playing.
3. Explain the differences between Frames and Script Structures.
4. Write a SUPER MARKET Script using
conceptual dependency primitives.
5.. Explain the difference between Forward Chaining and Backward Chaining
Discuss Truth Maintenance System with a neat diagram.
7. Explain Blocks World Problem.
B. Explain types of neural networks with neat sketches.
PART-B
Answer any Four (4x10=40)
questions:
9. a) What is Resolution? Explain Predicate Resolution algorithm. 5)
b) Explain Hierarchical Planning vith an example. (5)
10. Explain General Leaning Mode with a neat diagram.
. Explain Rule based expert ture with a neat diagram.
. system a
Explain different types of
13. learning ATN)
Explain Augmented Transition (ATN) with example
t w o r k (
example
Nelw
P.TO.
Reg. No.
I
v Semester MCA Degree bAamination, April - 2021
cOMPUTER SCIENCE
Artificial Intelligence
(CBCS Scheme)
Paper MCA 503 TT
Time: 3 Hours Maximum Marks: 70
Instructions to Candidates:
Answer any Five questions from Part A and any Four from PartB
PART-A
Answer any Five questions:
(5x6-30)
Define Artificial Intelligence. Discuss types of Knowledge Representations with example.
2. Explain minimax airategyförganme playing.
3. Explain the differences between Frames and Script Structures.
4. Write a SUPER MARKET Script using
conceptual dependency primitives.
5.. Explain the difference between Forward Chaining and Backward Chaining
Discuss Truth Maintenance System with a neat diagram.
7. Explain Blocks World Problem.
B. Explain types of neural networks with neat sketches.
PART-B
Answer any Four (4x10=40)
questions:
9. a) What is Resolution? Explain Predicate Resolution algorithm. 5)
b) Explain Hierarchical Planning vith an example. (5)
10. Explain General Leaning Mode with a neat diagram.
. Explain Rule based expert ture with a neat diagram.
. system a
Explain different types of
13. learning ATN)
Explain Augmented Transition (ATN) with example
t w o r k (
example
Nelw
P.TO.