MOTHER THERESA INSTITUTE OF ENGINEERING AND

TECHNOLOGY
MELUMOI, PALAMANER– 517 408

COURSE FILE
For
ARTIFICIAL INTELLIGENCE / 20A05502T
(AY 2022-23 III B.TECH CSE V Semester)

Prepared by
G.JAYAGOPI
Associate Professor

Department of
-COMPUTER SCIENCE AND ENGINEERING
 INDEX
PART I

1. Syllabus
2. Course Information Sheet
3. Course Objectives, Course outcomes
4. Mapping onto PEO & PO
5. Lesson Plan
6. Lecture Notes
7. University Question Paper
8. Internal Question Paper’s With Key
9. Assignment Topics
10. Tutorial Sheets
11. Unit wise Question Bank
12. Gaps & Plans for Add-On Programs
13. Topic beyond the syllabus - References
14. Web References
15. Teacher Log Book/ Attendance Register
 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY ANANTAPUR

B.Tech (IT)— III-I Sem L T P C

3 0 0 3
(20A05502T) ARTIFICIAL INTELLIGENCE

Course Objectives:
This course is designed to:
• Introduce Artificial Intelligence
• Teach about the machine learning environment
• Present the searching Technique for Problem Solving
• Introduce Natural Language Processing and Robotics
Course Outcomes:
After completion of the course, students will be able to
• Apply searching techniques for solving a problem
• Design Intelligent Agents
• Develop Natural Language Interface for Machines
• Design mini robots
• Summarize past, present and future of Artificial Intelligence

UNIT I Introduction 9Hrs

Introduction: What is AI, Foundations of AI, History of AI, and The State of Art.
Intelligent Agents: Agents and Environments, Good Behavior: The Concept of Rationality, The Nature of
Environments, And The Structure of Agents.
UNIT II Solving Problems by searching 9 Hrs
Problem Solving Agents, Example problems, Searching for Solutions, Uninformed Search
Strategies, Informed search strategies, Heuristic Functions, Beyond Classical Search: Local Search
Algorithms and Optimization Problems, Local Search in Continues Spaces, Searching with
Nondeterministic Actions, Searching with partial observations, online search agents and unknown
environments.
UNIT III Reinforcement Learning & Natural Language Processing 8Hrs
Reinforcement Learning: Introduction, Passive Reinforcement Learning, Active Reinforcement Learning,
Generalization in Reinforcement Learning, Policy Search, applications of RL
Natural Language Processing: Language Models, Text Classification, Information Retrieval, Information
Extraction.
UNIT IV Natural Language for Communication 8 Hrs
Natural Language for Communication: Phrase structure grammars, Syntactic Analysis, Augmented
Grammars and semantic Interpretation, Machine Translation, Speech Recognition
Perception: Image Formation, Early Image Processing Operations, Object Recognition by appearance,
Reconstructing the 3D World, Object Recognition from Structural information, Using Vision.
UNIT V Robotics l0Hrs
Robotics: Introduction, Robot Hardware, Robotic Perception, planning to move, planning uncertain
movements, Moving, Robotic software architectures, application domains
Philosophical foundations: Weak AI, Strong AI, Ethics and Risks of AI, Agent Components, Agent
Architectures, Are we going in the right direction, What if AI does succeed.
Textbooks:
1. Stuart J.Russell, Peter Norvig, “Artificial Intelligence A Modern Approach”, 3'd Edition, Pearson
Education, 2019.

Reference Books:

1. Nilsson, Nils J., and Nils Johan Nilsson. Artificial intelligence: a new synthesis. Morgan Kaufmann,
1998.
2. Johnson, Benny G., Fred Phillips, and Linda G. Chase. "An intelligent tutoring system for the
accounting cycle: Enhancing textbook homework with artificial intelligence." Journal of Accounting
Education 27.1 (2009): 30-39.
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
COURSE PLAN –ARTIFICIAL INTELLIGENCE (AY 2022-23)
Faculty Name : G.JAYAGOPI Course: B.Tech
Subject Name with code: Artificial Intelligence
Semester/ Branch : IIIYear – I Sem. / CSE
(20A055020T)

COURSE OBJECTIVE:

The student has to acquire knowledge about:

• Introduce Artificial Intelligence
• Teach about the machine learning environment
• Present the searching Technique for Problem Solving
• Introduce Natural Language Processing and Robotics

LEARNING OUTCOME:

Understand the concept of java .

 Implement the concepts of packages.
 \Use of API and implement the functions
 To design different applets.

COURSE OUTCOMES:

After completion of the course, students will be able to

• Apply searching techniques for solving a problem
• Design Intelligent Agents
• Develop Natural Language Interface for Machines
• Design mini robots
• Summarize past, present and future of Artificial Intelligence

PO Mapping with Course Outcomes:

CO1- 3, 2, 2, 2, -, -, -, -, -, -, -, 1, 3, 2
CO2- 2, 3, 2, 2, -, -, - , -, -, -, -, 1, 2, 2
CO3 – 3, 2, 2, 1, 3, -, -, -, -, -, -, 1, 3, 2
CO4 – 2, 3, 3, 2, 3, -, -, -, -, -, -, 2, 2, 3
CO5 – 3, 3, 2, 2, 2, -, -, -, -, -, -, 1, 3, 2
CO6 – 3, 3, 3, 2, 3, -, -, -, -, -, -, 2, 3, 3
 TEXTBOOKS:

1. Stuart J.Russell, Peter Norvig, “Artificial Intelligence A Modern Approach”, 3'd Edition, Pearson
Education, 2019.

REFERENCE BOOKS:

1. Nilsson, Nils J., and Nils Johan Nilsson. Artificial intelligence: a new synthesis. Morgan Kaufmann,
1998.
2. Johnson, Benny G., Fred Phillips, and Linda G. Chase. "An intelligent tutoring system for the
accounting cycle: Enhancing textbook homework with artificial intelligence." Journal of Accounting
Education 27.1 (2009): 30-39.

Assignments: 02
S.N Assignment Topic Date of Submission No. of Students Allotted
o Submitted Marks
1 PASSIVE & ACTIVE RL 09.11.2022 65 5
2 PERCEPTION 04.12.2022 65 5

Missing Topics Teaching Methodology Mapping to PO

Class Lecture PO1,PO2,PO3,PO4
ADVERSARIAL SEARCH
EXPERT SYSTEMS Class Lecture PO1,PO2,PO3,PO4

Topics Beyond the Syllabus Teaching Methodology Mapping to PO

KNOWLEDGE REPRESENTATION PPT PO1,PO2,PO3,PO4

Seminar Topics:
1. REASONING SYSTEMS FOR CATEGORIES
2. TRUST AND REPUTATION IN MULTI-AGENT SYSTEMS

Course Assessment:
1. 30 Marks for Internal + 70 Marks for University Examination.

2. Student feedback on the course (Scale of 1-5).

3. Mentee for 15 students

 HOD

Mapping onto PEO & PO

PO Description CO1 CO2 CO3 CO4 CO5
PO: 1 An ability to apply knowledge of YES YES YES YES YES
mathematics, science and engineering.
PO: 2 An ability to design and conduct YES YES YES YES YES
experiments, as well as to analyze and
interpret data.
PO: 3 An ability to design a system, component or YES YES YES YES YES
process to meet desired needs.
PO: 4 An ability to function on multi- disciplinary YES YES YES YES
teams.
PO: 5 An ability to identify, formulate and solve YES YES YES YES
engineering problems.
PO: 6 An understanding of professional and YES YES
ethical responsibility.
PO: 7 An ability to communicate effectively.
PO: 8 The broad education necessary to YES YES YES YES YES
understand the impact of engineering
solutions in a global and societal context.
PO: 9 Recognition of the need for, and an ability YES YES YES YES
to engage in life-long learning.
PO: 10 Knowledge of contemporary issues. YES
PO: 11 An ability to use the techniques, skills, and YES YES YES YES YES
modern engineering tools necessary for
engineering practice.
 MOTHER THERESA INSTITUTE OF ENGINEERING & TECHNOLOGY
MELUMOI, PALAMANER-517408
Approved By AICTE, New Delhi & Affiliated To JNTUA, Anantapuramu-515002
NAAC Accredited and an ISO 9001:2015 Certified Institution
Department of Computer Science & Engineering

LESSON PLAN

Name of the Faculty : G.JAYAGOPI Academic Year: 2022-2023

Subject Name : ARTIFICIAL INTELLIGENCE Class : III - CSE
Total Delivery
S. No of
Topic to be covered Reference Book No.of Method
No. Periods
Periods
UNIT-I Introduction: Black
1 T1(1-4) 1 1
What is AI Board
T1(5-15) 1 Black
2 Foundations of AI 2
Board
T1(16-27) 1 Black
3 History of AI 3
Board
T1(28-29) 1 Black
4 The State of Art. 4
Board
T1(34-35) Black
5 Intelligent Agents: Agents and Environments 2 6
Board
T1(36-39) Black
6 Good Behavior: The Concept of Rationality 1 7
Board
T1(40-45) Black
7 The Nature of Environments 1 8
Board
8 The Structure of Agents. T1(46-58) 2 10 PPT
UNIT-II Solving Problems by searching: T1(64-68) Black
9 2 2
Problem Solving Agents Board
T1(69-74) 2 Black
10 Example problems, Searching for Solutions 4
Board
T1(81-91) 1 Black
11 Uninformed Search Strategies 5
Board
T1(92-102) Black
12 Informed search strategies 2 7
Board
T1(103-107) Black
13 Heuristic Functions 2 9
Board
Beyond Classical Search: Local Search T1(121-129) Black
14 2 11
Algorithms and Optimization Problems Board
T1(130-133) Black
15 Local Search in Continues Spaces 1 12
Board
T1(134-138) Black
16 Searching with Nondeterministic Actions 1 13
Board
17 Searching with partial observations T1(139-147) 1 14 PPT
Online search agents and unknown T1(148-153) PPT
18 1 15
environments.
19 UNIT III Reinforcement Learning & T1(846-847) 1 1 Black
Natural Language Processing: Board
 Introduction
T1(848-854) Black
20 Passive Reinforcement Learning 1 2
Board
T1(855-860) Black
21 Active Reinforcement Learning 2 4
Board
T1(861-863) Black
22 Generalization in Reinforcement Learning 1 5
Board
23 Policy Search, applications of RL T1(864-867) 1 6 PPT
Natural Language Processing: Language T1(876-880) PPT
24 1 7
Models
T1(881-882) Black
25 Text Classification 1 8
Board
T1(883-887) Black
26 Information Retrieval 1 9
Board
T1(889-898) Black
27 Information Extraction. 1 10
Board
UNIT IV Natural Language for T1(904-907) Black
28 Communication: 1 1 Board
Phrase structure grammars
T1(908-912) Black
29 Syntactic Analysis, 2 3
Board
Augmented Grammars and semantic T1(913-922) Black
30 1 4
Interpretation Board
Machine Translation, Speech Recognition T1(923-928) Black
31 2 6
Perception: Board
Image Formation, Early Image Processing T1(945-957) Black
32 1 7
Operations Board
T1(958-961) Black
33 Object Recognition by appearance 1 8
Board
34 Reconstructing the 3D World T1(962-972) 1 9 PPT
Object Recognition from Structural T1(973-975) PPT
35 2 11
information,
36 Using Vision. T1(976-980) 1 12 PPT
UNIT V Robotics: T1(986-987) PPT
37 1 1
Introduction,
T1(988-1000) Black
38 Robot Hardware, Robotic Perception, 1 2
Board
planning to move, planning uncertain T1(1001-1017) Black
39 1 3
movements, Moving Board
T1(1018-1020) Black
40 Robotic software architectures 1 4
Board
Application domains Philosophical T1(1021-1032) Black
41 1 5
foundations: Board
42 Weak AI T1(1035-1040) 1 6 PPT
43 Strong AI T1(1041-1048) 1 7 PPT
T1(1049-1054) Black
44 Ethics and Risks of AI 1 8
Board
T1(1059-1061) Black
45 Agent Components, 1 9
Board
46 Agent Architectures T1(1062-1063) 1 10 Black
 Board
47 Are we going in the right direction T1(1064-1065) 1 11 PPT
48 What if AI does succeed T1(1066-1068) 1 12 PPT

Textbooks:
1. Stuart J.Russell, Peter Norvig, “Artificial Intelligence A Modern Approach”, 3rd Edition, Pearson
Education, 2019.

Reference Books:
1. Nilsson, Nils J., and Nils Johan Nilsson. Artificial intelligence: a new synthesis. Morgan
Kaufmann, 1998.
2. Johnson, Benny G., Fred Phillips, and Linda G. Chase. "An intelligent tutoring system for the
accounting cycle: Enhancing textbook homework with artificial intelligence." Journal of
Accounting Education 27.1 (2009): 30-39

Signature of Faculty HOD

 QUESTION BANK
QUESTION BANK
SUBJECT : Artificial
Intelligence YEAR / SEM: III Year / I
Sem

UNIT I
PART - A
Q.No Questions BT Level Competence
1. Define Heuristic function.
BTL-1 Remember
2. Name the elements of an agent and list down the
BTL-1 Remember
characteristics of intelligent agent.
3. How would you rank Production system?
BTL-5 Evaluate
4. How would you quote PEAS description?
BTL-1 Remember
5. Apply problem solving algorithm to measure
BTL-3 Apply
performance.
6. Explain the theme of Backtracking search for CSP.
BTL-5 Evaluate
7. Illustrate the categories of production systems.
BTL-3 Apply
8. List the types of constraints
BTL -1 Remember
9. Point out some of the uninformed search techniques.
BTL-4 Analyze
10. How would you formulate Constraint Satisfaction
BTL-6 Create
Problem?
11. Express what is ridge?
BTL-2 Understand
12. What do you infer from hill-climbing search algorithm?
BTL-4 Analyze
13. Generalize your opinion about admissible heuristic. BTL-6 Create
14. Define problem solving agents and list its algorithms.
BTL-1 Remember
15. Why problem formulation must follow goal
BTL-1 Remember
Formulation?
16. Summarize the factors that make up rationality. BTL-2 Remember
17. What do you infer from the word Agent?
BTL-4 Analyze
18. How much knowledge would be required by a perfect
program for the problem of playing chess? Assume that
BTL-2 Understand
unlimited computing power is available.

19. Will you state or interpret in your own words PEAS

BTL-2 Understand
description for a Vacuum cleaner?
20. Show what would happen if problem is decomposed.
BTL-3 Apply
PART – B
1. i) How did you describe PEAS description for
at least four agent types? BTL-1 Remembe
ii) How did you describe PEAS? r
2. Summarize in detail about production system
charactristics. BTL-2 Understand

3. Describe in detail about

i) Simple reflex agent.
ii) Model based agent. BTL-1 Remember
iii) Utility based agent
iv) Goal based agent
4. Can you apply the facts to describe Iterative deepening
depth first search. BTL-3 Apply

5. i) Explain Depth limited search in detail with

suitable example.
BTL-4 Analyze
ii) Explain the Travelling salesman Problem.

6. (i) Compare the decomposable and non-

decomposable. BTL-5 Evaluate
(ii) Summarize the characteristics of AI problem.
7. Discuss about
i) Greedy best-first search.
ii) A* search . BTL-2 Understand
iii) Memory bounded heuristic search.

8. i) Analyze theme of Local search algorithms.

ii) Analyze the theme of optimization problems. BTL-4 Analyze

9. ii) Compose your opinion about heuristic function

with example.
BTL-6 Create
iii) Compose the four necessary things to solve
a problem.
10. How do you examine about Backtracking search for
CSP? BTL-1 Remember
 11. i) Explain any two Informed Search Strategies
with an example.
ii) Explain the algorithm for generate and test BTL-4 Analyze
simple hill climbing.

12. Discuss about Constraint Satisfaction Problem. BTL-2 Understand

13. Describe the following uninformed
i) Depth First Search.
ii) Iterative Deepening Depth First Search. BTL-1 Remember
iii) Bidirectional Search.

14. i) Show the performance measure of various search

algorithms.
BTL-3 Apply
ii) Show the necessary components to define an AI
problem with an example.

UNIT II
PART - A
Q.No Questions BT Level Competence
1. Define alpha-beta pruning.(May/June-2017)(Nov/Dec-
2016) BTL-1 Remember

2. Define the term syntax and semantics in logic.

BTL-1 Remember
3. List the two levels of knowledge
BTL-1 Remember
representation.(Nov/Dec-2016)
4. Apply Backus – Naur form grammar for propositional
BTL-3 Apply
logic.
5. How would you describe entailment?
BTL-1 Remember
6. Assess the term truth table for logical connectives.
BTL-5 Evaluate
7. Discuss about representation of facts.
BTL-2 Understand
8. Where do you use inference?
BTL-3 Apply
9. How would you formulate pattern databases?
BTL-6 Create
10. Define tautology.
BTL-1 Remember
11. Illustrate well-formed formula in predicate logic for the
BTL-3 Apply
given sentence “All pompieans were Romans”.
12. Interpret the types of similarity net in finding the right
BTL-2 Understand
structures under knowledge representation.
13. Extend your views about universal instantiation.
BTL-2 Understand
14. How would you deduce an Absolver?
BTL-5 Evaluate
15. Compare propositional logic and predicate logic and
BTL-4 Analyze
list down their characteristics.
16. Discuss about BNF for first order logic. BTL-2 Understand
 17. Generalize your opinion about inference rules for
BTL-6 Create
propositional logic.
18. Analyze the theme behind resolution. BTL-4 Analyze
19. Name the elements of FOL.
List the functions performed in problem solving. BTL-1
BTL-1 Remember
Remember
20. Compare and contrast universal and existential
BTL-4 Analyze
quantifier.
PART - B
6. Can you collect an example for Bayesian belief network? BTL-1 Remember
1. Discuss in detail about Logic and give an example.
7.15. Analyze the applications in Bayesian network. BTL-4 Understand
BTL-2 Analyze
8.16. Express your views about Linguistic variable. BTL-2 Understand
Recommend the theme behind reactive systems. BTL-5 Evaluate
9. Define about Meta rules. BTL-1 Remember
10.17. Criticize about accessibility
2. How would
(i)Summarize you aboutexpress
Minimax therelation
statistical
algorithmproperty.
learning?
in detail. BTL-5
BTL-2 Evaluate
Understand
How wouldAlpha,
11. (ii)Discuss you classify the types ofAlpha-Beta
methods used in
18. What conclusion Beta
can you pruning
inferand from problem solving and BTL-5 Evaluate
probabilistic reasoning?
algorithm. BTL-3 Understand
planner BTL-4 Analyze
12. i)What
3. Explain
do you in detail
infer from aboutgeneralized
models for modus predicate logic.rule?
ponens BTL-4 Analyze
13.19. ii) Explain
What
Generalize are Assertions
the
thedifferent
term fuzzyand typesqueries
setofand insubset.
first-order logic.
planners? BTL-4
BTL-6 Analyze
Create
BTL-4 Analyze
14. Differentiate forward chaining and backward chaining.
4.20. Relate first order logic with proposition logic and BTL-2 Understand
Examine what would happen if robot arm performs an
discuss
15. Express in detail about the same. BTL-3
BTL-3 Apply
Apply
action ininblock your own world? words about skolemization. BTL-2 Understand
16. Formulate your opinion about inference PARTrules -B
5.
What would happen if we use UNIT
skolem IV for
function in system? BTL-6 BTL-6 Apply
1. propositional
How did youlogic. describe components of a planning Create
resolution? PART - A BTL-1 Remember
17. (i)
Q.No
6. What Howiswouldthe useyou of online
tabulate search
Questions
the agent inofunknown
Syntax FOL? BT Level Competence
2. environment?
i) Summarize about various types of learning in problem BTL-4 Analyze
1. (ii)
Define HowRote
solving. would you define a semantics for first
learning BTL-1 Remember
Remember
Extend
18. order your opinion about the properties of fuzzy BTL-1
BTL-2 Understand
logic?
ii) Express
2. Why
sets do you your applyviews ABSTRIPSabout learning
approach bytotaking
problemadvice. BTL-2 Create
BTL-3 Apply
19.
7. solving?
How
What would
conclusion you define
can you a belief
infer interval
from in
KnowledgeDempster- Shafer
i) Analyze the theme of Learning with examples.
3. theory? BTL-1 Remember
3. engineering
Identify in
thelearning first order
advantages oflogic?
inductive learning. BTL-4
BTL-1 Analyze
Analyze
ii) Explain in decision
20. Label an example for Bayesian belief network and give the Tree with example. BTL-4 Analyze
4. BTL-1
Baye’s rule
8. Describe
Design athe equation.
following
decision tree about
for your Using
ownFOL Example. BTL-6 Remember
Create
4. i) i)Kinship
Describe in detail about EBL.PART - B
domain
5.1. ii)Distinguish between supervised and-shafer
unsupervised BTL-1 Remember
ii)
Numbers
Describe What insetsIs ID3?write
detail andabout
lists. the drawback
dempster oftheory.
ID3. BTL-1
BTL-2 Remember
Understand
learning.
5. iii)Describe
The Wumpus world problem. BTL-1 Remember
in detail about Goal stack planning. BTL-1 Remember
6.
9.2. How would
Generalize you
the associate
term predicate
classification. logic to represent the BTL-6 Create
Can you apply
(i) Evaluate
6. knowledge the identified
a reactive system. facts to describe Bayesian BTL-2 Understand
with example? BTL-3
BTL-5 Apply
Evaluate
7. probabilistic
(ii) Assess theinference?
theme of block world problem.
How would you define macro-operators? BTL-1 Remember
Expressthe
3.7. (i)(i)Analyze your views about
importance Rote Learning.
of fuzzy sets. BTL-4
8. (ii) How would you express Formal learning theory? BTL-2 Analyze
Understand
10. (i) (ii)How
How did you
would
Explain youdescribe
about natural aResolution
identify ?plan that hasin
completecomputations
language been
detail.
8. discovered
(i)How How BTL-1 Remember
4. (ii) would
(i) Discuss about in wouldyou
goal the
you planning?
identify
stack integrate
definition an of your opinion
example
FOL with for about BTL-1 Remember
discovery?
resolution? BTL-6 Create
9. appropriate
(ii) Extend example. your (6)
opinion about analogy. BTL-2 Understand
Define adaptive learning BTL-1 Remember
(i)Describe
(ii)
11.9. Explain structured
Illustrate inabout
detail about First
representation
nonlinear order inference
of knowledge
planning . rule.
using constraint BTL-4 Analyze
10.
12.
5. Discuss about with
(i)positioning
Explain resolution
an example.with example . BTL-2
BTL-3 Understand
Apply
Point out theabout forward
differences chaining
and algorithm
similarities betweenin detail.
problem
13. Describe (ii) the
Illustrate
(ii) Explain use of
about predicate
overview calculus
of in
planning.
in detail about Backward Chaining algorithm knowledge BTL-4
BTL-4 Remember
Analyze
and planning. BTL-1 Remember
10. representation.
What
with anconclusion
example . can you infer from UNIT-IIIhierarchical
11. planning? BTL-4 Analyze
6.
14. (i)
How Assess
will the
you theme
show of
an fuzzy
example
i) Illustrate the user of First Order Logic to sets and
for compare
STRIPS – with
Style sets.
11. (ii)
Explain in detail about aboutActivetheory PART
and Passive - A Reinforcement BTL-3
BTL-5 Apply
Evaluate
11. i)operatorsSupport
represent
Explain for your
the
Knowledge.
the views
blocks
Inference in Temporal of
world? fuzzy
models. sets. BTL-4
BTL-3 Analyze
Apply
Q.No ii) learning . Questions BTL-4
BT Level Analyze
Competence
12.
7. ii)Compare
Discuss Write aboutshort note on versus
Procedural
inference Unification.
rules for Declarative
quantifiers. knowledge.
12. Discuss
1. Discuss
Define frame
machine
Bayesian problem.
learning with
Network.(May/June-2016). example . BTL-2
BTL-2 Understand
BTL-1 Understand
Remember
12. Discuss about the exact inference in Bayesian networks. BTL-2
BTL-2 Understand
8.
2. How
13. Describe
i) Write would you
inindetail
detail define
aboutresolution?
about hierarchical
completeness planning method
of resolution. BTL-1 Remember
BTL-1 Remember
13.
3. i)Write
with an short notes on Hidden Markov model.
example.
13.
9. WhatHow will you apply
i) Generalize your an example
opinion about for distribute ^ over v? BTL-1 Remember
ii)
Write Write
isshort short
hierarchical
notes notes on Logic
onplanning?
adaptive andConstrain
Express Slot-and-Filler
learning. your views about BTL-1 Remember
Satisfaction Problem. BTL-3
BTL-2 Apply
Understand
three Structures
planning
Demostrate : techniques. BTL-6 Create
14.
4. How would you
ii) Compose yourrank dilation,
opinion aboutconcentration
back trackingand search for BTL-3 Apply
(i)Learning by
14. normalization in parameter
fuzzy theory? Adjustment (ii)Learnignwith BTL-5 Evaluate
CSP.
14. Grade
Illustrate the tworepresentation
capabilities included of Slotsinasabout
ROTE learning.
5. How do youthe
Macro-operators show that you understand Full-Fledged
default BTL-5
BTL-3 Evaluate
Apply
10. Describe in detail about Bayesian network. BTL-1
Objects
reasoning?
(iii)Learningwith example.
by chunking BTL-3 Remember
Apply
 UNIT V
PART - A
Q.No Questions BT Level Competence
1. List the characteristic features of expert
BTL-1 Remember
system.
2. Identify the types of knowledge and possible structures. BTL-1 Remember
3. What would you infer from a typical expert system? BTL-4 Analyze
4.
How would you distinguish MYCIN and DART? BTL-2 Understand
5. Will you summarize or interpret in your own words
about different learning methods under performance BTL-2 Understand
measures?
6. Examine the four earliest expert systems.
BTL-3 Apply

7. Assess the activities of knowledge acquisition. BTL-5 Evaluate

8. Examine MOLE-p. BTL-3 Apply
9.
How would you classify the different knowledge types? BTL-3 Understand
10. Analyze the components of black board system. BTL-4 Analyze
11. What are the common mechanism supported in an
BTL-6 Apply
expert system shell ?
12.
Assess the theme of rule master building system. BTL-5 Evaluate
13.
Define uncertainty. How it is solved? BTL-1 Remember
14. How would you interpret in your own words about
BTL-2 Create
neural network?
15. Associate knowledge acquisition process to a real world
BTL-2 Understand
problem.
16. What conclusion can you infer from personal consultant
BTL-4 Analyze
plus?
17. Generalize advantages of the MYCIN. BTL-6 Create
18.
Name the components of typical expert system. BTL-1 Remember
19. Define XCON. BTL-1 Remember
20. List the three activities supported by the BTL-1 Remember
programs that interact with domain experts to
extract expert Knowledge.
 PART - B
1. Described in detail about expert systems including
representation usage of domain knowledge BTL-1 Remember
,reasoning and explaining.
2. i) Examine about Associative or semantic network
architecture. BTL-1 Remember
ii) Examine about frame architecture.
3. Explain in detail about General Learning Model. BTL-4 Analyze
4. (i) How do you examine Performance measure in
Knowledge acquisition?
BTL-1 Remember
(ii) Describe in detail about Characteristic feature of
expert system.
5. Can you apply the facts to describe
i) Decision tree architecture. BTL-3 Apply
ii) Blackboard system Architecture .
6. i) What conclusion can you infer from Analogical
reasoning Architecture?
BTL-4 Analyze
ii) Explain in detail about Neural Network
Architecture?
7. i) Evaluate in detail about knowledge acquisition.
BTL-5 Evaluate
ii) How would you rank validation?
8. i) Interpret in your own words about PC plus .
BTL-2 Understand
ii) How would you associate Radian Rule master?
9. Associate KEE and OPS5 system to a real world
BTL-2 Understand
problem.
10. Integrate your opinion about DART, MYCIN and
BTL-6 Create
XCON.
11. Explain the architecture of Expert System with neat
BTL-4 Analyze
diagram.
12. Discuss Knowledge Acquisition. BTL-2 Understand
13. i) Write short notes on Meta knowledge.
BTL-1 Remember
ii) Write short notes on Heuristics.
14. Illustrate in detail about the MYCIN expert system and
its functioning. BTL-3 Apply