CE DEPARTMENT

ARTIFICIAL INTELLIGENCE - QUESTION BANK

CHAPTER 1 1. 2. 3. 4. What is Intelligence? Define Artificial Intelligence in your terms. List various task domains of AI. Give various applications of Artificial Intelligence with example. Explain different techniques to solve various AI problems.

CHAPTER 2 5. Define state space representation. Find a state space representation for the following problems. a. 8 puzzle b. TSP c. Chess d. Water jug e. Missionaries and cannibals f. Tower of Hanoi g. Monkey and Bananas h. crypt arithmetic 6. Analyze the following problems with respect to the seven problem characteristics. a. 8 puzzle b. TSP c. Chess d. Water jug e. Missionaries and cannibals f. Tower of Hanoi g. Monkey and Bananas h. Crypt arithmetic 7. Explain advantages and limitations of BFS and DFS. 8. What are various issues in the design of search programs? 9. What is a Production System? Explain the characteristics of good control strategy. 10. Describe how the branch and bound technique can be used to solve a water jug problem. 11. Give an example of a problem for which BFS would work better than DFS. 12. Give an example of a problem for which DFS would work better than BFS. 13. What is a heuristic search? What is the importance of heuristic function? Describe a good heuristic function for: a. Blocks world

b. Missionaries and cannibals c. 8 puzzle CHAPTER 3 14. Explain Hill climbing algorithm with example. 15. Explain steepest ascent Hill climbing algorithm with example. 16. Define: Local maximum, Plateau, Ridge. Also mentions various techniques to deal with these problems. 17. Explain Simulated Annealing algorithm. Apply it to TSP problem. 18. What is Best First search? Explain A* algorithm and admissibility of A*. 19. What is AND-OR graph? Explain with example. 20. Explain AO* Algorithm. 21. Trace the constraint satisfaction procedure for following crypt-arithmetic problems. C R O S S + R O AD S DA N G E R 22. Explain Means-Ends Analysis algorithm. 23. Solve 8 puzzle problem using Hill Climbing algorithm. Define good heuristic function for it. Apply it to solve an instance of 8 puzzle problem. 24. Rewrite the constraint satisfaction procedure to use, a. Breadth first search b. Best first search 25. Explain depth limited search. Write an algorithm for Iterative Deepening Search. 26. Explain Iterative Deepening A* Search algorithm. Differentiate between A* and IDA*. 27. Explain recursive best first search. Differentiate it with best first search.