COLLEGE: COLLEGE OF ENGINEERING KIDANGOOR

EIGHTH SEMESTER B.TECH DEGREE EXAMINATION, JUNE 2021

Course Code: CS464
Course Name: ARTIFICIAL INTELLIGENCE
Max. Marks: 70 Duration: 2.15 Hours

PART A
Answer all questions, each carries 3 marks. Marks

1 Is mini-max procedure a depth first or breadth first search procedure. Justify. (3)
2 Define informed and uninformed searches with suitable example. (3)
3 Measure problem solving performance of iterative deepening depth first search. (3)
4 What is a semantic net? Represent the sentence “John is taller than bill” in (3)
semantic net.
5 Convert “I gave the man a book” into conceptual dependency. (3)
6 Give evaluation function to estimate of utility of states in mini-max search. (3)
7 What is learning? Explain emergent models of learning. (3)
8 Discuss three natural language applications. (3)
9 Differentiate expert system from knowledge base system. (3)
10 What are the three main components of classifier system? (3)
PART B
Answer any two full questions, each carries 6 marks.
11 a) What are the components of 8 puzzle problem. ( 3)
b) Explain the control strategies used to prepare production system. You are given two (3)
jugs(no measuring marker) of capacity 5l and 3l (liter), and a tap with an endless
supply of water. Write the steps to measure 4 liters exactly in the 5-liter jug with
the minimum steps possible.
12 a) Illustrate the method of minimizing the total estimated solution cost using A* (4)
algorithm.
b) Solve the following crypt arithmetic problem stating all the constraints. (2)
TWO
+TWO
-------------
FOUR
13 a) Discuss how problem of unbounded trees in DFS can be alleviated with depth (6)
limit. Measure the performance of depth limited search.

Page 1of 2
 PART C
Answer any two full questions, each carries 6 marks.
14 a) (3)

Convert the above arch into semantic net.

b) Describe the components of scripts. (3)
15 What is pruning? Discuss Alpha Beta pruning with example. (6)
16 a) Explain the process of data gathering and data pre-processing in machine (3)
learning.
b) How will you design a good heuristics? What are the two situations where (3)
problem solvers employ heuristics?
PART D
Answer any two full questions, each carries 8 marks.
17 Discuss how generalization tree and specialization tree converge to draw (8)
solution in version space search.
18 a) Define natural language processing. What are its components? What does (4)
linguistics science include?
b) Explain the process of deconstructing language. (4)
19 a) Justify that back-propagation is a supervised learning algorithm, for training (4)
multi-layer perceptron’s.
b) What are the stochastic tools used for language analysis. (4)
****

Page 2of 2