0% found this document useful (0 votes)
70 views12 pages

Artificial Intelligence

artificial-intelligence

Uploaded by

smce.ramu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
70 views12 pages

Artificial Intelligence

artificial-intelligence

Uploaded by

smce.ramu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

SRM VALLIAMMAI ENGINEERING COLLEGE

(An Autonomous Institution)


SRM Nagar, Kattankulathur – 603 203

DEPARTMENT OF ELECTRONICS AND COMMUNICATION


ENGINEERING

QUESTION BANK

VI SEMESTER

1904006 – ARTIFICIAL INTELLIGENCE


Department Of ELECTRONICS AND COMMUNICATION ENGINEERING

Regulation – 2019
Academic Year 2021 – 2022 Even Semester

Prepared by

Dr. S. Ramesh,
Associate Professor – ECE

Prepared By: Dr. S. RAMESH, SRM VEC/BE/ECE/21-22/EVEN/QB/VI/1904006-AI Page 1 of 12


SYLLABUS
COURSE OBJECTIVES: The student should be made to:
• To understand the various characteristics of Intelligent agents
• To learn the different search strategies in AI
• To learn to represent knowledge in solving AI problems
• To understand the different ways of designing software agents
• To know about the various applications of AI.

UNIT - I: INTRODUCTION 9
Introduction - Foundation and history of AI. AI Problems and techniques - AI programming
languages – Introduction to LISP and PROLOG – Problem spaces and searches -Blind search
strategies; Breadth first - Depth first –Heuristic search techniques Hill climbing - Best first –
A* algorithm AO* algorithm – game trees Minimax algorithm – Game playing – Alpha beta
pruning.

UNIT: II: KNOWLEDGE REPRESENTATION 9


Knowledge representation issues – Predicate logic – logic programming – Sematic nets -
Frames and inheritance - constraint propagation –Representing Knowledge using rules –
Rules based deduction system.

UNIT - III: REASONING UNDER UNCERTAINTY 9


Introduction to uncertain knowledge review of probability – Baye’s Probabilistic inferences
and Dempster Shafer theory –Heuristic methods – Symbolic reasoning under uncertainty-
Statistical reasoning – Fuzzy reasoning – Temporal reasoning- Non monotonic reasoning.

UNIT - IV: PLANNING AND LEARNING 9


Planning - Introduction, Planning in situational calculus - Representation for planning –
Partial order planning algorithm- Learning from examples- Discovery as learning –
Learning by analogy – Explanation based learning –Introduction to Neural nets – Genetic
Algorithms.

UNIT - V: APPLICATIONS 9
Principles of Natural Language Processing Rule Based Systems Architecture - Expert
systems- Knowledge Acquisition concepts – AI application to robotics – Current trends in
Intelligent Systems.
TOTAL: 45 PERIODS
COURSE OUTCOMES: At the end of the course, the student should be able to:
• Use appropriate search algorithms for any AI problem.
• Represent a problem using first order and predicate logic.
• Provide the apt agent strategy to solve a given problem.
• Design software agents to solve a problem.
• Design applications for NLP that use Artificial Intelligence.
TEXT BOOKS:
1. Patrick Henry Winston,” Artificial Intelligence”, Addison Wesley, Books Third edition,
2000.
REFERENCE BOOKS:
1. George F Luger, “Artificial Intelligence”, Pearson Education, 6th edition,2009.
2. Engene Charniak and Drew Mc Dermott, “Introduction to Artificial intelligence”, Addison
Wesley 2000.
3. Nils J. Nilsson, “Principles of Artificial Intelligence”, Narosa Publishing House, 2000.
Prepared By: Dr. S. RAMESH, SRM VEC/BE/ECE/21-22/EVEN/QB/VI/1904006-AI Page 2 of 12
UNIT I - INTRODUCTION
Introduction - Foundation and history of AI. AI Problems and techniques - AI programming
languages – Introduction to LISP and PROLOG – Problem spaces and searches -Blind search
strategies; Breadth first - Depth first –Heuristic search techniques Hill climbing - Best first –
A* algorithm AO* algorithm – game trees Minimax algorithm – Game playing – Alpha beta
pruning.
PART – A
Q.No Questions BT Level Competence
1. Define artificial intelligence (AI). BTL 1 Remembering
2. Differentiate natural intelligence from artificial intelligence. BTL 2 Understanding
3. What is AI capable of today? BTL 1 Remembering
4. List four approaches that are followed in AI. BTL 1 Remembering
5. Identify the strong and weak AI. BTL 1 Remembering
6. When it comes to human behavior, will the machine be exact? BTL 1 Remembering
7. Compare between human and machines. BTL 2 Understanding
8. Mention the area where AI can be used. BTL 1 Remembering
9. Summarize the major components of AI. BTL 2 Understanding
10. Infer a list of the qualities of an artificially intelligent agent. BTL 4 Analyzing
11. Distinguish between LISP and PROLOG. BTL 2 Understanding
12. Select the two basic types of search strategies. BTL 3 Applying
13. Inspect on which basic search algorithms are chosen. BTL 4 Analyzing
14. Show that how search strategies are evaluated. BTL 3 Applying
15. Can you formulate why heuristic search techniques are BTL 6 Creating
considered to be powerful than the traditional search techniques.
16. Assess the advantages of heuristic function. BTL 5 Evaluating
17. Interpret the reason when hill climbing often gets stuck. BTL 5 Evaluating
18. Create a partial game tree for the game of tic-tac-toe. BTL 6 Creating
19. How would you demonstrate that alpha–beta pruning BTL 3 Applying
outperforms the minimax search algorithm?
20. What inference can you draw about how minimax can be BTL 4 Analyzing
extended to a game of chance?

PART - B
1. Explain in details about the four approaches that are (13) BTL 4 Analyzing
followed in AI.
2. Summarize the various disciplines that contributed the ideas, (13) BTL 2 Understanding
view points and techniques to AI.
3. Illustrate the concept of strong and weak AI which also gives (13) BTL 3 Applying
basic foundation for developing automated systems.
4. (i) Describe the history of artificial intelligence from the year (7) BTL 1 Remembering
1943.
(ii) Describe the minimax procedure for game playing. (6)
5. (i) Explain the list of expert systems influential in AI filed. (7) BTL 4 Analyzing
(ii) Infer the effect of heuristic accuracy on performance. (6)
Prepared By: Dr. S. RAMESH, SRM VEC/BE/ECE/21-22/EVEN/QB/VI/1904006-AI Page 3 of 12
6. Discuss in detail about the structure of different intelligent (13) BTL 2 Understanding
agents.
7. How LISP and PROLOG can help you in regard of (13) BTL 1 Remembering
developing artificial intelligence? Explain in detail with
features.
8. (i) How to minimize total estimated cost using A* search (8) BTL 1 Remembering
with an example.
(ii) Write the proof of optimality of A*. (5)
9. (i) Demonstrate the AO* algorithm with a suitable example. (10) BTL 3 Applying
(ii) State the limitations in the algorithm. (3)
10. Identify and discuss any two uninformed search methods (13) BTL 1 Remembering
with examples.
11. (i) Formulate the minimax and alpha–beta algorithms and (7) BTL 6 Creating
how it works for the game of tic-tac-toe.
(ii) Develop a formal proof of correctness for alpha–beta (6)
pruning.
12. (i) Explain the role of artificial intelligence in the future. (7)
BTL 4 Analyzing
(ii) Give example for perfect decisions in game playing (6)
13. Evaluate the performance problem solving method based on (13) BTL 5 Evaluating
depth first search algorithms.
14. (i) Interpret the best first, depth first and breadth first search. (8) BTL 2 Understanding
(ii) When would best first search be worse than simple (5)
breadth first search?

PART - C
1. Interpret the comparison and contrast between human (15) BTL 5 Evaluating
intelligence and artificial intelligence by citing examples and
applications.
2. Consider the given problem. Formulate the operator involved in (15) BTL 6 Creating
it. Consider the water jug problem: You are given two jugs, a 4-
gallon one and 3-gallon one. Neither has any measuring marker
on it. There is a pump that can be used to fill the jugs with
water. How can you get exactly 2 gallons of water from the 4-
gallon jug? Explicit Assumptions: A jug can be filled from the
pump, water can be poured out of a jug on to the ground, water
can be poured from one jug to another and that there are no
other measuring devices available.
3. Assess the process of simulated annealing with example. (15) BTL 5 Evaluating
4. Develop your own multi agent systems with the help of (15) BTL 6 Creating
an illustration.

Prepared By: Dr. S. RAMESH, SRM VEC/BE/ECE/21-22/EVEN/QB/VI/1904006-AI Page 4 of 12


UNIT II - KNOWLEDGE REPRESENTATION
Knowledge representation issues – Predicate logic – logic programming – Sematic nets - Frames
and inheritance - constraint propagation –Representing Knowledge using rules – Rules based
deduction system.
PART - A
Q.No Questions BT Level Competence
1. What do you mean when you say knowledge representation? BTL 1 Remembering
2. What is prepositional logic? BTL 1 Remembering
3. Determine the drawbacks of using prepositional logic to BTL 5 Evaluating
represent the knowledge base.
4. Express the resolution in prepositional logic. BTL 2 Understanding
5. Differentiate monotonic and non-monotonic reasoning. BTL 2 Understanding
6. Name two standard quantifier. BTL 1 Remembering
7. Why is unification necessary? BTL 1 Remembering
8. Distinguish between prepositional versus first order predicate BTL 2 Understanding
logic.
9. Analyze the factors justify whether the reasoning should be BTL 4 Analyzing
done forward or backward?
10. Define first order definite clause. BTL 1 Remembering
11. Illustrate the meta rules. BTL 3 Applying
12. Evaluate the generalized modus ponens rule. BTL 5 Evaluating
13. List the types of knowledge. BTL 1 Remembering
14. Mention the role of knowledge. BTL 6 Creating
15. Interpret the use of semantic networks. BTL 2 Understanding
16. Create the structure of a frame. BTL 6 Creating
17. Pointout the conjunctive normal form of a rule. BTL 4 Analyzing
18. Express the steps to convert first order logic sentence to normal BTL 3 Applying
form?
19. Selecting an example, define diagnostic rules. BTL 3 Applying
20. Compare prepositional logic with FOL. BTL 4 Analyzing

PART – B
1. Show the various problems that are represented in the (13) BTL 3 Applying
knowledge.
2. With the help of examples, summarize the various (13) BTL 2 Understanding
approaches to knowledge representation.
3. (i) Examine the algorithm for deciding entailment in (7) BTL 1 Remembering
prepositional logic.
(ii) List the five logical connectivity used to construct the (6)
complex sentences and give the formal grammar of
prepositional logic.
4. Write down and explain the unification algorithm in (13) BTL 1 Remembering
predicate logic.
Prepared By: Dr. S. RAMESH, SRM VEC/BE/ECE/21-22/EVEN/QB/VI/1904006-AI Page 5 of 12
5. (i) Define and compare the atomic sentence and complex (7) BTL 1 Remembering
sentence.
(ii) Differentiate forward chaining and backward chaining. (6) BTL 2 Understanding
6. Discuss the syntax and semantics of first order logic. (13) BTL 2 Understanding
7. Analyze the forward chaining and backward chaining with (13)
BTL 4 Analyzing
examples.
8. Illustrate the first order logic to represent knowledge. (13) BTL 3 Applying
9. Consider the following sentences: John likes all kinds of BTL 5 Evaluating
food; Apples are food; Chicken is food; Anything anyone
eats and isn’t killed by is food; Bill eats peanuts and still is
alive; Sue eats everything Bill eats.
(i) Translate these sentences into formulas in predicate logic. (7)
(ii) Convert the formulas of part an into clause form. (6)
10. (i) Interpret the standard quantifiers of first order logic with (7) BTL 2 Understanding
example.
(ii) Write short notes on unification. (6) BTL 1 Remembering
11. How are frames used in knowledge representation? Give the (13) BTL 1 Remembering
structure of a general frame.
12. Develop and explain a simple semantic network with a small (13) BTL 6 Creating
number of facts and relations.
13. Explain in details about the representing knowledge using (13)
BTL 4 Analyzing
rules.
14. Infer the rules-based deduction system with examples. (13) BTL 4 Analyzing

PART - C
1. Formulate the following sentences to predicate logic, BTL 6 Creating
(i) Marcus was a man, (4)
(ii) Marcus was a pompeian, (4)
(iii) All pompeians were roman, (4)
(iv) Caser was a ruler. (3)
2. Consider the following facts, (15) BTL 6 Creating
Steve only likes easy courses,
All the courses in HaveFun department are easy,
BK301 is a HaveFun department course.
Use resolution to solve the question “What course would Steve
like”?
3. Determine the semantic net representation for the following, BTL 5 Evaluating
(i) Pompeian (Marcus), Balcksmith (Marcus); (8)
(ii) Mary gave the green flowered vase to her favorite cousin. (7)
4. Assess the following sentences in conceptual dependency BTL 5 Evaluating
representation.
(i) “Since smoking can kill you”, I stopped. (8)
(ii) “Bill threatened John with a broken nose”. (7)

Prepared By: Dr. S. RAMESH, SRM VEC/BE/ECE/21-22/EVEN/QB/VI/1904006-AI Page 6 of 12


UNIT III - REASONING UNDER UNCERTAINTY
Introduction to uncertain knowledge review of probability – Baye’s Probabilistic inferences
and Dempster Shafer theory –Heuristic methods – Symbolic reasoning under uncertainty-
Statistical reasoning – Fuzzy reasoning – Temporal reasoning- Non monotonic reasoning.
PART - A
Q.No Questions BT Level Competence
1. What you mean by probabilistic reasoning? BTL 1 Remembering
2. Express the Baye’s theorem. BTL 2 Understanding
3. Draw the fuzzy curve for tall, short, very tall. BTL 6 Creating
4. Differentiate between forward and backward reasoning. BTL 2 Understanding
5. Define Dempster-Shafer theory. BTL 1 Remembering
6. Interpret the reasoning by default. BTL 2 Understanding
7. Determine the logics used in reasoning with uncertain BTL 5 Evaluating
information.
8. Examine the concept of prior probability. BTL 4 Analyzing
9. List the types of approximation methods. BTL 1 Remembering
10. What exactly do you mean when you say hybrid Bayesian BTL 3 Applying
network?
11. Analyze the computational learning theory. BTL 4 Analyzing
12. Generalize the full specification of Bayesian network. BTL 6 Creating
13. Infer about uncertainty. BTL 4 Analyzing
14. How uncertainty is solved? BTL 1 Remembering
15. Distinguish between supervised and unsupervised learning. BTL 2 Understanding
16. Show the advantages of inductive learning. BTL 3 Applying
17. What is overfitting? BTL 1 Remembering
18. Select the various types of machine learning. BTL 5 Evaluating
19. How would you gain access to fuzzy's performance? BTL 3 Applying
20. Identify the heuristic function. BTL 1 Remembering

PART - B
1. (i) Derive Baye’s theorem probability. (7) BTL 3 Applying
(ii) Illustrate with suitable example, Baye’s theorem use in (6)
expert system.
2. Explain the probabilistic reasoning with suitable examples. (13) BTL 4 Analyzing
3. Discuss the need and structure of Bayesian network. (13) BTL 2 Understanding
4. Summarize how fuzzy logic is beneficial over classical (13) BTL 2 Understanding
probability theory.
5. (i) List down the applications of Bayesian network. (7) BTL 1 Remembering
(ii) Discuss forward – backward algorithm in detail. (6)
6. (i) Interpret variable elimination algorithm for answering (7) BTL 2 Understanding
queries in Bayesian network.
(ii) How is the Bayesian network used in representing the (6)
uncertainty about the knowledge.
7. Describe in details about Dempster-Shafer theory. (13) BTL 1 Remembering
8. Analyze the method of performing exact inference in (13) BTL 4 Analyzing
Bayesian network.

Prepared By: Dr. S. RAMESH, SRM VEC/BE/ECE/21-22/EVEN/QB/VI/1904006-AI Page 7 of 12


9. (i)Define uncertain knowledge, prior probability and (7) BTL 1 Remembering
conditional probability.
(ii) Examine belief networks briefly. (6)
10. Assess the need of fuzzy set and fuzzy logic with example. (13) BTL 5 Evaluating
11. Illustrate the different methods of heuristic with examples. (13) BTL 3 Applying
12. Analyze any two machine learning algorithms with an (13) BTL 4 Analyzing
example.
13. Write a short note on, BTL 1 Remembering
(i) Symbolic reasoning under uncertainty, (7)
(ii) Statistical reasoning. (6)
14. Elaborate the concept of the following, BTL 6 Creating
(i) Temporal reasoning, (7)
(ii) Non monotonic reasoning. (6)

PART - C
1. Suppose the police is informed that one of the four terrorists (15) BTL 6 Creating
organization A, B, C or D has planted a bomb in a building.
Draw the lattice of subsets of the universe of discourse, U.
Assume that one evidence supports that groups A and C were
responsible to a degree of m1{A, C} =0.6 design and another
evidence supports the belief that groups A, B and D were
involved to a degree m2{A, B, D} =0.7. Compute and create the
tableau of combined values of belief for m1 and m2.
2. Consider the following facts: (i) I saw my cat in the living room (15) BTL 5 Evaluating
3 hours ago, (ii) 2 hours ago my door blew open, (iii) Three
quarters of the time my door blows open, my cat runs outside
the door, (iv) One hour ago I thought I heard a cat noise in my
living room. Assume I was half certain, (v) In one hour period
the probability that cat will leave the room is 0.2. There is also
0.2 probability that he may enter the room. What is the
uncertainty that the cat is in the living room? Use Bayesian
networks to evaluate this.
3. Consider an incandescent bulb manufacturing unit. Here (15) BTL 6 Creating
machines M1, M2 and M3 make 30%, 30% and 40% of the total
bulbs of their output. Let’s assume that 2%, 3% and 4% are
defective. A bulb is drawn at random and is found defective.
Solve the probability that the bulb is made by machine M1 or
M2 or M3?
4. (i)With an example, how do you deal with uncertain (8) BTL 5 Evaluating
knowledge?
(ii) How should knowledge be represented in a domain that is (7)
uncertain?

Prepared By: Dr. S. RAMESH, SRM VEC/BE/ECE/21-22/EVEN/QB/VI/1904006-AI Page 8 of 12


UNIT IV - PLANNING AND LEARNING
Planning - Introduction, Planning in situational calculus - Representation for planning – Partial
order planning algorithm- Learning from examples- Discovery as learning – Learning by
analogy – Explanation based learning –Introduction to Neural nets – Genetic Algorithms.
PART - A
Q.No Questions BT Level Competence
1. What does planning involve? BTL 1 Remembering
2. Express the contingency planning. BTL 2 Understanding
3. What does hierarchical task network planning do? BTL 2 Understanding
4. Define critical path. BTL 1 Remembering
5. List classic search technique could be applied to planning BTL 1 Remembering
state.
6. If the problems are nearly decomposable, we can treat them as BTL 2 Understanding
decomposable and then patch them, how?
7. Identify the different types of planning techniques. BTL 1 Remembering
8. Select the components of learning agent. BTL 3 Applying
9. Classify learning types. BTL 4 Analyzing
10. Infer the various techniques that can be represented by learned BTL 4 Analyzing
information.
11. Write the properties of inductive learning model. BTL 1 Remembering
12. Pointout the problems in decision tree. BTL 4 Analyzing
13. Assess the major issues that affect the design of a learning BTL 5 Evaluating
element.
14. Generalize the learning from observation is not same as BTL 6 Creating
learning from inference.
15. Discuss inductive learning. BTL 2 Understanding
16. Formulate the three factors involved in the analysis of BTL 6 Creating
efficiency gains from explanation-based learning.
17. Illustrate about the overfitting. BTL 3 Applying
18. How is learning done with hidden variables? BTL 1 Remembering
19. Interpret about the support vectors. BTL 5 Evaluating
20. Mention the advantages of genetic algorithms in AI? BTL 3 Applying

PART - B
1. Examine about nonlinear planning using constraint posting. (13) BTL 1 Remembering
2. Illustrate the five components of a planning system. (13) BTL 3 Applying
3. Write short notes on, BTL 1 Remembering
(i) Goal stack planning, (7)
(ii) Hierarchical planning. (6)
4. Discuss in detail the architecture of utility-based learning (13) BTL 2 Understanding
agent.
5. (i) Inspect the decision tree learning algorithm. (7) BTL 4 Analyzing
(ii) Explain in detail learning from observation. (6)
Prepared By: Dr. S. RAMESH, SRM VEC/BE/ECE/21-22/EVEN/QB/VI/1904006-AI Page 9 of 12
6. Explain the concept of learning using decision tree and (13) BTL 4 Analyzing
neural network approach.
7. (i) What is explanation-based learning? (3) BTL 1 Remembering
(ii) Examine steps involved in explanation-based learning. (10)
8. Analyze the concept on learning using decision trees and (13) BTL 4 Analyzing
neural networks approach.
9. (i) Distinguish between feed-forward and recurrent neural (7) BTL 2 Understanding
network structure.
(ii) Interpret back propagation process with its algorithm. (6)
10. (i)How genetic algorithm works in AI? Explain with (7) BTL 1 Remembering
examples.
(ii) List the advantages and disadvantages of genetic (6)
algorithm
11. Evaluate the active and passive reinforcement learning with (13) BTL 5 Evaluating
suitable example.
12. Generalize the various types machine learning with (13) BTL 6 Creating
examples.
13. Summarize about, BTL 2 Understanding
(i) Explanation-based learning, (7)
(ii) Least commitment search. (6)
14. Illustrate about the, BTL 3 Applying
(i) Learning by parameter adjustment, (5)
(ii) Learning with macro-operators, (4)
(iii) Learning by chunking. (4)

PART - C
1. Assess the use of planning graph in providing better heuristic (15) BTL 5 Evaluating
estimation with suitable example.
2. What is meant by inductive logic programming? How does top- (15) BTL 5 Evaluating
down inductive learning methods and inductive learning with
inverse deduction work? Explain.
3. Consider a simple domain: waiting at a traffic light. Give an BTL 6 Creating
example of decision tree for this domain.
(i) Create a list of relevant variables, (5)
(ii) How the concept of information or expected information (10)
gain can be used to determine which variable to choose for a
maximally compact decision tree.
4. In the case of learning to play cricket. Formulate whether this is (15) BTL 6 Creating
supervised or reinforcement learning and explain.

Prepared By: Dr. S. RAMESH, SRM VEC/BE/ECE/21-22/EVEN/QB/VI/1904006-AI Page 10 of 12


UNIT V - APPLICATIONS
Principles of Natural Language Processing, Rule Based Systems Architecture - Expert systems-
Knowledge Acquisition concepts – AI application to robotics – Current trends in Intelligent
Systems.
PART - A
Q.No Questions BT Level Competence
1. What are the two subdivisions of natural language processing? BTL 1 Remembering
2. Differentiate morphology using finite state transducer and BTL 2 Understanding
words act as building blocks.
3. Write the applications of natural language processing. BTL 1 Remembering
4. Mention the two ways in which natural language processing BTL 3 Applying
systems can make life easier for people with disabilities.
5. Define expert systems. BTL 1 Remembering
6. List some of the early expert systems. BTL 1 Remembering
7. Find the various components of expert systems. BTL 3 Applying
8. Express the basic characteristics of expert systems. BTL 2 Understanding
9. Illustrate the knowledge representation. BTL 3 Applying
10. Draw schematic diagram showing various functions of expert BTL 1 Remembering
system.
11. Interpret the questions primarily addresses by the epistemology. BTL 5 Evaluating
12. Classify the types of knowledge. BTL 4 Analyzing
13. Compile the elements of knowledge engineering process. BTL 6 Creating
14. Compare knowledge and meta- knowledge. BTL 2 Understanding
15. Assess knowledge is crucial aspect of expert systems. BTL 5 Evaluating
16. Distinguish open and closed loops in AI robotics control BTL 2 Understanding
systems.
17. Formulate the applications can you envision for shape changing BTL 6 Creating
robots in the future?
18. Infer the blocks of robot from the AI decomposition. BTL 4 Analyzing
19. Will artificial intelligence replace human? BTL 1 Remembering
20. Pointout the new trends in intelligence? BTL 4 Analyzing

PART – B
1. Express classic problems in natural language processing and (13) BTL 2 Understanding
schools of thought with example.
2. Summarize the natural language processing techniques. (13) BTL 2 Understanding
3. Write short notes on, BTL 1 Remembering
(i) Natural language understanding, (7)
(ii) Natural language generation. (6)
4. Explain the expert systems architectures: Rule based system (13) BTL 4 Analyzing
architecture, Associative architecture, Network architecture,
Black board system architecture.

Prepared By: Dr. S. RAMESH, SRM VEC/BE/ECE/21-22/EVEN/QB/VI/1904006-AI Page 11 of 12


5. Explain with necessary illustrations for the following terms, BTL 3 Applying
(i) Knowledge acquisition process, (7)
(ii) Knowledge elicitation. (6)
6. Discuss the various components of expert system and their (13) BTL 2 Understanding
importance in expert system.
7. Analyze the need, significance and evolution of XCON (13) BTL 4 Analyzing
expert system.
8. (i) List out the problems are addressed by expert systems. (7) BTL 1 Remembering
(ii) Examine the DART expert system. (6)
9. Illustrate a detailed note on expert systems including (13) BTL 3 Applying
representation, usage of domain knowledge, reasoning and
explaining.
10. (i) Write short note on common sense. (7) BTL 1 Remembering
(ii) Write advantages and disadvantages of expert systems. (6)
11. (i) What was one of the earliest implementations of a self- (7) BTL 1 Remembering
driving vehicle, and Which AI method was used?
(ii) What advantages exists for robotic simulations over the (6)
development of real physical robot embodiments? What
issues to simulations present?
12. Compare the early development of robotics to those being (13) BTL 4 Analyzing
developed today. How have advancements in the field of
electronics affected robotics research today?
13. Assess block world problem in robotics with example. (13) BTL 5 Evaluating
14. Elaborate the five key artificial intelligence trends 2022. (13) BTL 6 Creating

PART - C
1. In the context of morphology, which of parsing and generation (15) BTL 5 Evaluating
is harder? Give an example to justify your answer.
2. A search engine is designed to work over a collection of 1000 (15) BTL 5 Evaluating
documents. In response to a query Q, the system retrieves 200
documents, of which 15 are found to be relevant. It is known
from human judgements that the collection has 25 documents
which are relevant to Q. Estimate the precision and recall of
retrieval.
3. Design an expert system for travel recommendation and discuss (15) BTL 6 Creating
its roles.
4. Elaborate a detailed note about the MYCIN expert system and (15) BTL 6 Creating
its functioning.

Prepared By: Dr. S. RAMESH, SRM VEC/BE/ECE/21-22/EVEN/QB/VI/1904006-AI Page 12 of 12

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy