CS-14 : INTELLIGENT
SYSTEMS DEC 1997
| Time : 3 Hours |
Max. Marks : 75 |
Note : Question 1 is compulsory. Answer any three from the rest.
| 1. | (a) | Translate the following axioms into predicate calculus wffs(well formed formulas) |
| (i) If town x is connected to town y by highway z and bicycles are allowed on z, you can get to y from x by bike | ||
| (b) |
Write a PROLOG program that answers questions about family members and relationships. Include predicates and rules which define sister, brother, father, mother, grandchild, grandfather and uncle. The program should be able to answer queries such as the following : |
|
| ?-father(x, Ram) ? -grandson(X, Y) ? -uncle(Mohan, Leela) ? -mother (Sonia, X) |
||
| (c) | Express the following concepts as an associate network structure with interconnected nodes and labelled arcs. | |
|
(i) Company XYZ is a software development company. Three
departments within the company are Sales, Administration and Programming.
Ram is the manager of Programming department. Mohan and Shyam are
programmers. Shyam is married to Leela. Leela is an editor of a weekly
news magazine. They have 2 children and they live in Delhi. Leela wears
glasses and is very tall. |
||
| 2. | (a) | Explain the difference between forward and backward chaining and under what conditions each would be best to use for a given set of problems. |
| (b) | Identify and describe one good application area for the expert system within an open university environment. | |
| 3. | (a) | Given the advantages of expert system architecture based on decision tree over those of production rules. What are the main disadvantages ? |
| (b) | How do rules in PROLOG differ from general production system rules? | |
| 4. | (a) | Given an example of each of four type 0, 1, 2 and 3 for Chomsky's hierarchy of grammars. |
| (b) | Develop a page tree for the
sentence "Shyam slept on the platform" using the following rules : S NP NP VP PP N DET PREP |
|
| 5. | (a) | Discuss and compare hill climbing and best-first search techniques. |
| (b) | Using the search tree given below, list the elements of the queue just before the next node is expanded. Use best-first search where the numbers corresponding to estimated cost-to-goal for each corresponding node | |
![]() |
||
| 6. | Write a short notes on the following | |
| (a) | Blackboard system architecture | |
| (b) | Types of learning | |
| (c) | Deterministic parser |