[07 BENG 3121]
IIIAV B.Tech. DEGREE
EXAMINATION.
First Semester
Computer Science and Engineering
ARTIFICIAL INTELLIGENCE
(With effective from the admitted batch of
20020-2021)
Time: Three hours Maximum: 70 marks
First question compulsory.
Answer any FOUR from the remaining
questions.
All questions carry equal marks.
1. (a) What is meant by consistent and admissible
heuristic?
(b) What is monotonic and non-monotonic
reasoning?
(c) Define the terms inferential efficiency and
Acquisitional efficiency.
(d) Convert the following wff into clause form
Vx3ypostman (y) abite(x, y)->dog (x)|
(e) What is partitioned sematic net?
( Define pragmatic processing and discourse
integration.
(g) Write about expert system 'shell.
2 (a) How are production system and control
strategies applied in solving AI problems?
(b) Explain depth first search (DFS) and
breadth first search (BFS) with suitable
example. Why is depth limited search'
necessary in DFS?
3. (a) Using Best - first search algorithm solves
the following Towers of Hanoi problem.
Left: Initial state Right: Goal state
The cost of moving the small disk
is 1, Moving the middle sized disk is 2, and
moving the large disk is 3. Hence the
average cost is 2. The heuristic function has
follows:
2 x
2 numbers of disks not on the
rightmost peg
(b) Illustrate means - ends analysis with robot
navigation problem.
2 [07 BENG 3121]
(a) What is partial matching? Explain with
suitable example.
(b) Describe various issues in knowledge
representation.
(a) Represent the following sentence into
portioned semantic nets
() Every man has beaten the thief
i) All persons in the party loved every
child.
(b) Discuss various components of script. Give
an example of each component.
6 (a) Illustrate resolution algorithm in predicate
logic with example.
(b) Explain about Dempster's - Safer theory
with suitable example.
J. (a) What is an expert system? Describe the
components of expert systems.
b) Show that how STRIPS would solve the
following goal stack planning problem
A A
B D B | D
Start ON (C,D)AON (A, B) A Goal : aN(C, B) AON (A, D)a
ON TABLE (8) A ON TABLE (D) ON TABLE Q9A aTABLE (D)
ARMENPTY
3 [07 BENG 3121]
8. (a) Write about knowledge acquisition and
validation techniques.
b) Derive parse tree for the sentence Bill loves
the Cat' where the following rules are used:
S NP|VP, DET > The,
NP N,
V loves, NP DET N, N » Bill|CAT.
Modify the grammar to allow NP to have
zero to many
adjectives.
[07 BENG 3121]
