Professional Documents
Culture Documents
QB Module 1 & 2
QB Module 1 & 2
QB Module 1 & 2
MODULE -1
1. Define Intelligence and Artificial Intelligence. Write short notes on problem areas in Artificial
Intelligence.
2. State Tower of Hanoi/ Missionaries and Cannibals Problem and give its State Space.
3. List four things to build a system to solve a problem.
4. Explain four characteristics to build a system in order to solve a problem. Define State Space.
5. What is Production System? Explain production system
characteristics.
6. What is Physical Symbol System? What is AI technique? How does AI exploit knowledge?
7. Define Artificial Intelligence. Explain in detail about Turing Test.
8. Explain Water Jug Problem as a state space search/ Write the Production Rules for Water
Jug Problem.
9. Give examples of Problems which are decomposable, non-decomposable, have a solution as a path
and a state.
10. What is Production System? Describe different classes of Production Systems with examples.
11. What are the issues with Steepest Hill Climbing? How it is taken care by Simulated Annealing?
12. Explain A* algorithm with example.
13. What is Means-Ends Analysis? Explain with an example.
14. What do you mean by heuristic?
15. Explain Hill climbing Heuristic search.
16. Define state space search & problem space.
17. Explain problem reduction.
18. Write short notes on Constraint satisfaction method.
19. Write AO* algorithm and explain the steps in it.
20. What is heuristic search? What are the advantages of Heuristic Search?
21. Explain annealing schedule.
22. Explain Breadth-first search and depth-first search. List down the advantages and
disadvantages of both.
23. What do you mean by an AI Technique? Discuss the tic-tac-toe problem in detail and
explain how it can be solved using AI technique.
24. What are problem characteristics?
25. Write a heuristic function for travelling salesman problem.
26. Apply A* Algorithm to the following graph, where S is the Initial State and G is the Goal state.
The table below indicates h’ values.
State h(n)
S 6
A 2
B 4
C 1
D 2
G 0
27. How AND-OR graphs are used for problem reduction? Explain.
MODULE – 2