SRM University 2007 B.Tech Computer Science and Engineering BANMK : : ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS - Question Paper

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
S.R.M.ENGINEERING COLLEGE
ques. BANMK
III B.Tech (CSE)
SUBJECT: ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS

CODE: CS307
UNIT –I
PART-A
1. What is AI?
2. What are the task domains of artificial intelligence?
3. List the properties of knowledge?
4. What is an AI technique?
5. What are the steps to build a system that solves a problem?
6. What is a state space?
7. Explain the process operationalization?
8. How to describe the issue as a state space search?
9. What does the production system consists of?
10. What are the requirements of a good control strategy?
11. What is chronological backtracking?
12. Give the advantages of depth-first search?
13. Give the advantages of breadth-first search?
14. What is combinatorial explosion?
15. Give an example of a heuristic that is useful for combinatorial problems?
16. What is heuristic?
17. Define heuristic function?
18. What is the purpose of heuristic function?
19. Write down the different issue characteristics?
20. What is certain result and uncertain result issue with examples?
21. What are the classes of issues with respect to solution steps with eg?
22. Illustrate the difference ranging from any-path and best issue with examples?
23. What are the kinds of issues with respect to task interaction with a person?
24. What is propose and refine?
25. What is monotonic production system?
26. What is nonmonotonic production system?
27. What is commutative and partially commutative production system?
28. What are weak methods?
29. Write generate and test algorithm?
30. How is hill climbing various from generate and test?
31. When hill climbing fails to obtain a solution?
32. What is local maximum?
33. What is ridge?
34. What is plateau?
35. List the ways to overcome hill climbing problems?
36. Differentiate steepest accent from basic hill climbing?
37. Differentiate simple hill climbing from simulated annealing?
38. What are the components essential to choose an annealing schedule?
39. What is best 1st search process?
40. State ‘Graceful decay of admissibility’
41. What is an agenda?
42. What is the limitation of issue reduction algorithm?
43. What is constraint satisfaction?
44. What is operator subgoaling?
45. Define playing chess

PART-B

1. Explain briefly the different issue characteristics?
2. What are the issues encountered during hill climbing and elaborate the ways available to deal with these problems?
3. Explain the process of simulated annealing with example?
4. Write A* algorithm and explain briefly the different observations about algorithm?
5. explain AO* algorithm in detail?
6. Write in detail about the constraint satisfaction procedure with example?
7. Explain how the steepest accent hill climbing works?
8. Write in detail about the mean end analysis procedure with example?

Earning:   Approval pending.