Scribd
Upload
453 views3 pages

Previous University Question Paper

This document appears to be an exam for an Artificial Intelligence and Expert Systems course. It contains 19 questions across 3 modules testing students' knowledge of topics like propositional logic, search algorithms, knowledge representation, expert systems, and Lisp programming. Students are asked to prove logical statements, explain AI concepts, represent information using graphs and scripts, design expert system phases, and write Lisp programs to implement sorting and search algorithms.

Uploaded by

safu_117
Copyright
© Attribution Non-Commercial (BY-NC)
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
453 views3 pages

Previous University Question Paper

This document appears to be an exam for an Artificial Intelligence and Expert Systems course. It contains 19 questions across 3 modules testing students' knowledge of topics like propositional logic, search algorithms, knowledge representation, expert systems, and Lisp programming. Students are asked to prove logical statements, explain AI concepts, represent information using graphs and scripts, design expert system phases, and write Lisp programs to implement sorting and search algorithms.

Uploaded by

safu_117
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 3

*8016*

Reg. No. : .................................... Name : .........................................

(Pages : 3)

8016

Sixth Semester B.Tech. Degree Examination, December 2009 (2003 Scheme) 03.606 (7) : ARTIFICIAL INTELLIGENCE & EXPERT SYSTEMS (TA)
Time : 3 Hours PART A Answer all questions. (104=40 Marks) Max. Marks : 100

1. Prove that implication is transitive in the propositional calculus, that is, that ((P Q) (Q R )) (P R ) . 2. Explain the searching in AND/OR graph using backtrack algorithm. 3. Given the differences between the architectures of computers and that of the human brain. What relevance does study into the structure and function of biological systems have for the engineering of AI program ? Justify your answer. 4. Define Production system. 5. Explain the architecture of a rule-based expert system. 6. Describe various schemes for knowledge representation. 7. Represent the following sentences using Conceptual graph. a) Ram gave Gopal the book b) Vishnu planted a mango sapling.

P.T.O.

8016

-2-

*8016*

8. Briefly explain the following LISP commands using examples. i) LIST ii) CONS iii) EQUAL

9. Surely computers cannot be intelligent - they can only do what their programmers tell them. Is the latter statement true ? and does it imply the former ? 10. Using conceptual dependences describe the script for A College Library. PART B Answer any two questions from each Module. Module 1 (210=20 Marks)

11. Explain the procedure of MINIMAX Alpha-Beta pruning method. How performance of the above algorithm can be improved ? 12. Write A* algorithm and show how A* algorithm can be used to find minimal-cost overall path or simply any path as quickly as possible. 13. A farmer wants to get a lion, a goose, a fox and some rice across the river. There is a boat, but farmer can take only one passenger in addition to himself on each trip, or else can take both lion and the rice or both the fox and the rice. The goose will eat rice, fox will eat goose and lion will eat fox if kept unattended by the farmer. Using state space approach, show how he managed to get every thing across the river ?

*8016*

-3-

8016 (210=20 Marks)

Module 2

14. What are the various issues in knowledge representation ? Explain. 15. Design the phases of an expert system to diagonose childhood ailments. 16. Explain various methods of organising and representing knowledge. Module 3 (210=20 Marks)

17. Write a LISP program to implement the Breadth-first-search algorithm. Implement the Best-first-search algorithm through straight forward modification of the Breadth -first-search algorithm. Explain the Modifications. 18. There are two buckets of water, one with 5 liters and the other, larger one, with 8 liters of water. There are various operations possible with these two buckets of water, they can be filled, emptied and dumped one into the other either until the poured - into the bucket is full or until the poured - out of bucket is empty. Device a sequence of action that will result 6 liters of water in the larger one. Implement a Depth first solution to the above problem. 19. Write a LISP program that will accept a set of integer numbers and sort the numbers in descending order.
_____________________

You might also like