Q.
Question 1: How does the use of heuristics reduce the search space ?
Suggest a god heuristic function for travelling salesman problem.
Question 2: Write short notes on the following :
(i) Knowledge manipulation
(ii) Associative networks
(iii) Fuzzy matching algorithms
(iv) Conceptual Dependency Graph
Question 3: Discuss state space representation for the following well-known problems:
(i) Travelling Salesman Problem
(ii) Water-Jug Problem
(iii) Human Cannibal River-Crossing Problem.
Question 4: Represent the following situation with Associative networks.
"IGNOU is an open university established by an act of parliament. It has various schools of studies and Divisions to support academic activities at the Head Quarters. IGNOU's regional centers are spread all over the country to manage the academic and administrative activities. Each School and Division is headed by a Director and each Regional Centre is headed by Regional Directors."
Question 5: (a) Compare and contrast the following (Any two):
i) A* and AO*
ii) Conceptual graph and conceptual representation
iii) Scripts and frames
(b) Write short notes on any two of the following:
i) Expert systems
ii) Methods to deal with Uncertainities in knowledge systems
iii) Non Deductive Inference rules
Question 6: Write a LISP program to solve a quadratic equation ax2 + bx + c = 0
having real coefficients a, b, c.
