Hall Ticket No Question Paper Code: ACSB13
INSTITUTE OF AERONAUTICAL ENGINEERING
(Autonomous)
Dundigal, Hyderabad - 500 043
MODEL QUESTION PAPER-I
B.Tech VII Semester End Examinations, June – 2022
Regulations: IARE - UG-20
PRINCIPLES OF ARTIFICIAL INTELLIGENCE
Information Technology
Time: 3 hour Maximum Marks: 70
Answer ONE Question from each MODULE
All Questions Carry Equal Marks
All parts of the question must be answered in one place only
MODULE-I
1. (a) Explain Knowledge Mapping Techniques? What are the issues in knowledge
representation? [BL: Remember— CO: 1—Marks: 7]
(b) What are the Problem Characteristics of Artificial Intelligence?
[BL: Remember— CO: 1—Marks: 7]
2. (a) How is Machine Learning related to Artificial Intelligence?
[BL: Understand— CO: 1—Marks: 7]
(b) Describe how the branch- and -bound technique could be used to find the shortest solution
to a water jug problem. [BL: Remember— CO: 1—Marks: 7]
MODULE-II
3. (a) Write unification algorithm and explain resolution in predicate logic?
[BL: Remember— CO: 2—Marks: 7]
(b) Explain Resolution in brief with an example. [BL: Understand— CO: 2—Marks: 7] [7m]
4. (a) How much knowledge would be required by a perfect program for the problem of playing
chess? Assume the unlimited computing power is available.
[BL: Remember— CO: 2—Marks: 7]
(b) What is forward chaining and how does it work ?explain forward chaining algorithm with an
example [BL: Understand— CO: 2—Marks: 7]
MODULE-III
5. (a) Discuss AO* algorithm in detail? [BL: Remember— CO: 3—Marks: 7]
(b) How means-ends analysis Works ? Explain with Algorithm?
[BL: Understand— CO: 3—Marks: 7]
6. (a) Write in detail about Generate and Test and Simple Hill Climbing.
[BL: Create— CO: 3—Marks: 7]
(b) Explain the Minimax algorithm. [BL: Create— CO: 3—Marks: 7]
MODULE-IV
7. (a) Explain about Non Monotonic reasoning and Logics for Non Monotonic reasoning.
[BL: Understand— CO: 4—Marks: 7]
(b) Explain Dempster-Shafer Theory. [BL: Understand— CO: 4—Marks: 7]
8. (a) What is fuzzy logic? Explain briefly. [BL: Evaluate— CO: 4—Marks: 7]
(b) Using MYCIN’S rules for inexact reasoning,compute CF,MB,and MD of h1given three ob-
servations where. [BL: Apply— CO: 4—Marks: 7]
MODULE-V
9. (a) Explain the Characteristics of Expert systems [BL: Remember— CO: 5—Marks: 7]
(b) Discuss about the Knowledge Acquisition process in Expert Systems
[BL: Understand— CO: 6—Marks: 7]
10. (a) Write short notes on Nonlinear Planning using Constraint Posting
[BL: Understand— CO: 5—Marks: 7]
(b) Explain MYCIN. [BL: Remember— CO: 6—Marks: 7]
**END OF EXAMINATION**
Page 2
COURSE OBJECTIVES:
The course should enable the students to:
I Gain a historical perspective of AI and its foundations.
II Become familiar with basic principles of AI toward problem solving, inference,
knowledge representation, and learning.
III Investigate applications of AI techniques in intelligent agents, expert systems,
artificial neural networks and other machine learning models.
IV Experience AI development tools such as Prolog (AI language), expert system
shell, and/or data mining tool.
V Explore the current scope, potential, limitations, and implications of intelligent
systems.
COURSE OUTCOMES:
After successful completion of the course, students should be able to:
CO 1 Summarize knowledge representation and issues in AI and Related Understand
fields.
CO 2 Demonstrate knowledge reasoning with predicate logic and Understand
inference rules in the presence of incomplete and/or uncertain
information.
CO 3 Choose Heuristic, Adversarial search and game playing algorithms Apply
for addressing a particular AI problem and implement the selected
strategy.
CO 4 Experiment with uncertainty issues by using statistical and Apply
symbolic reasoning approaches.
CO 5 Outline subfields and applications of AI such as planning, learning, Understand
and expert systems in specific domain problems.
CO 6 Demonstrate knowledge representation with the help of AI Understand
languages and tools.
QUESTION PAPER 1: MAPPING OF SEMESTER END EXAMINATION
QUESTIONS TO COURSE OUTCOMES
Q.No All Questions carry equal marks Taxonomy CO’s PO’s
a Explain Knowledge Mapping Techniques? Remember CO 1 PO 1
1
What are the issues in knowledge
representation?
b What are the Problem Characteristics of Remember CO 1 PO 1,2
Artificial Intelligence?
a How is Machine Learning related to Artificial Understand CO 1 PO 1
2
Intelligence?
b Describe how the branch- and -bound Remember CO 1 PO 1
technique could be used to find the shortest
solution to a water jug problem.
Page 3
a Write unification algorithm and explain Remember CO 2 PO 4
3
resolution in predicate logic?
b Explain Resolution in brief with an example Understand CO 2 PO
1,2,3
a How much knowledge would be required by a Remember CO 2 PO
4
perfect program for the problem of playing 1,2,3
chess? Assume the unlimited computing power
is available.
b What is forward chaining and how does it Understand CO 2 PO 4
work ?explain forward chaining algorithm with
an example
a Discuss AO* algorithm in detail? Remember CO 3 1,2,3
5
b How means-ends analysis Works ? Explain Understand CO 3 1,2
with Algorithm?
a Write in detail about Generate and Test and Create CO 3 PO 1,2
6
Simple Hill Climbing.
b Explain the Minimax algorithm Create CO 3 1,2
a Explain about Non Monotonic reasoning and Understand CO 4 PO
7
Logics for Non Monotonic reasoning. 1,3,4
b Explain Dempster-Shafer Theory. Understand CO 4 PO
1,3,4
a What is fuzzy logic? Explain briefly. Evaluate CO 4 PO
8
1,2,3
b Using MYCIN’S rules for inexact Apply CO 4 PO
reasoning,compute CF,MB,and MD of h1given 1,3,4
three observations where
a Explain the Characteristics of Expert systems Remember CO 5 PO
9
2,3,4
b Discuss about the Knowledge Acquisition Understand CO 6 PO
process in Expert Systems 2,3,4
a Write short notes on Nonlinear Planning using Understand CO 5 PO
10
Constraint Posting 1,2,3
b Explain MYCIN. Remember CO 6 PO 1,2
Page 4
KNOWLEDGE COMPETENCY LEVELS OF MODEL QUESTION PAPER
12
12
10
8
COUNT 7
6
2 1
0 0
0
ly
e
r
e
z
be
at
an
pp
ly
u
em
na
t
al
rs
Ev
A
em
e
nd
R
BLOOMS TAXONOMY
Mr.Vinesh Gone, Assistant Professor HOD - IT
Page 5
