AIML - Module 1-Question Bank
AIML - Module 1-Question Bank
1. Define i) Intelligence ii) Artificial Intelligence iii) Agent iv) Logical Reasoning
2. Briefly explain the Task domains of AI.
3. What is an Artificial Intelligence technique? Explain with an example.
4. What are AI problem characteristics? Explain each with an Example.
5. What is a Production System? Discuss the different categories of production systems.
6. Taking the 8-puzzle problem as an example, clearly explain the concept of state space search –
indicating the meanings of the following terms:
a) State space b) Initial state c) Goal state d) Legal operation
Draw the State space tree and show one possible solution for the following initial and goal state
To be transformed
1 2 3 1 2 3
⟹ 8 5 6 4 5 6
4 7
7 8
Initial state / configuration (start) Goal state/configuration (Final)
7. There are 2 water jugs of 6-litre and 8-litre. Neither has any measuring marker. There is a tap that
can be used to fill the jugs with the water. Indicate how 8-litre jug can be filled half. Solve this
Water-Jug problem by giving complete set of production rules and state space tree.
8. Provide a formal and complete problem description for the problem “play chess”.
9. Three married couples come to the river bank A. There is a boat on bank A that can carry
at most
two persons want to cross the river and reach bank B using the boat but there are certain
conditions to be observed.
a. No lady wants to row the boat
b. No lady wants travel in the boat with a man other than her husband.
c. No lady wants to stay on a bank with other man when her husband is not there unless she
has the company of other lady
d. No man wants to row the boat more than thrice
Give a possible solution to this problem. Write state-space representation of the above problem
indicating different states, operators and conditions for using operators.
10. Formulate and show the complete state space tree along with one possible solution for the
Missionaries and Cannibals problem
11. Analyze the seven AI problem characteristics for the following
e. Missionaries and Cannibals
f. Tower of Hanoi
g. Chess
12. What are the issues in designing search program ?
13. Write the procedure for hill-climbing search Technique. Explain with
suitable example, Briefly discuss about the problems in hill climbing and the
ways of dealing with these problems
14. Explain the means-ends analysis of search technique with an example
15. What do you mean by heuristics? Discuss the importance of heuristics in problem
solving
16. Discuss in detail the A* algorithm & AO* algorithm.(problems)
17. Explain the Depth-first-search and Breadth-First search procedures with an
example for each. List their advantages and disadvantages
18. Explain the advantages of Best-first-search over Hill Climbing with suitable example
19. Give the simplified algorithm for problem reduction. Also discuss the AO* algorithm.
20. Define the Constraint Satisfaction Problem. Solve the following crypt-arithmetic
problems.
SEND CROSS TWO
+ MO R E + ROADS + TWO
Consider a Hypothesis space defined over these instances in which each hypothesis is represented by a pair of 4-
tuples and where each attribute constraint may be a specific value”?” or “ ø“.
(i) Provide the hand trace of the CANDIDATE-ELIMINATION algorithm learning from the above training examples
and the hypothesis language. Show specific and general version space after each training example is processed.
(ii) How many distinct hypothesis from the given hypothesis space are consistent with the single positive training
example +((male black short Portuguese) (female blonde tall Indian))