1. G51IAI Introduction to AI
Dr Rong Qu
Exam

2. Exam Schedule Provisional exam schedule
Jan 2011
2 hours
You need to answer FOUR from the six questions
25 marks per question
Answering more questions won’t give you more marks
100% assessment on exam in G51IAI

3. Exam content Everything covered in the lectures
AI introduction, history
Blind searches
Heuristic searches
Data mining
Game playing
Neural networks
Theorem proving
Knowledge representation

4. Some previous questions
Question in exam
A* algorithm 10 30 12 5 17 15 19 11 8 6 M L K H J I G F E D C B A 20
Note: not drawn to scale A 56 E 29 I 8 M B 22 F 30 J 5 C G 14 K D H 10 L 15

5. Some previous questions
Question in exam
Provide the search tree for your solution, showing the order in which the nodes were expanded and the cost at each node. You should not re-visit a town that you have just come from
State the route you would take and the cost of that route
If the distances changed, how does it affect the route
f = g(n) + h(n)

6. Some previous questions
Question in exam
Apply alpha-beta pruning technique A D E F G B C 10 H J I K L M 12 3 15 14 8 N O 18
Min

7. Some previous questions10
Min A D E F G B C H J I K L M N O 10
>=14
Max  10
<=3 14
Min  10 12 3 15 14

8. Some previous questions
Question in exam
Show how the threshold can be set as 0, and still act the same
AND Function 1 X1 X2 Y
Threshold(Y) = 2

9. Some previous questions
AND Function 1 X1 X2 Y
Threshold(Y) = 2
Input 1
Input 2
Weight 1
Weight2
Sum
Step(t) 1 2

10. Some previous questionsy x -1
W = 1.5
W = 1
Threshold(Y) = 0
Input 1
Input 2
Input 3
Sum
Step(0) -1
-1.5 1
-0.5
0.5

11. Some previous questions
Question in exam
For given truth tables, say if a perceptron can learn the output i)
Input 1
Required Output

12. Some previous questions
Input 1
Required Output
0,1
1,1 ? ?
0,0
1,0

13. Some previous questions
Question in exam
Draw the complete tree for NIM game
Apply minimax technique to the search tree

14. 7
6-1
5-2
4-3
5-1-1
4-2-1
3-2-2
3-3-1
MAX
MIN 1 1 1 1 1 1

15. Some previous questions
Question in exam Malaysia
Foxes and Chickens

16. Some previous questions
Three foxes and three chickens seek to cross a river. A boat is available which can hold two animals and which can be navigated by any combination of foxes and chickens involving one or two animals.
The chickens insist on never being left in a minority on either riverbank, for fear of being eaten by a majority of foxes.
Find a schedule of crossings that will permit all the foxes and chickens to cross the river safely.

17. Some previous questions
Representing The Problem

18. Some previous questions
Representing The Problem F F F C C C B

19. Some previous questions

20. Some previous questions

21. Finally…
Good luck!
Please stay and …
SEM and SET forms