Professional Documents
Culture Documents
9618/03/SP/21 © Ucles 2018
9618/03/SP/21 © Ucles 2018
6 (a) Artificial Intelligence (AI) can be aided by the use of different techniques.
Technique Description
A* Algorithm
A computer program that improves its performance
at certain tasks with experience.
Graph
[4]
1 ................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
2 ................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
[4]
(b) Explain the problem that occurred in part (a) when representing the number in system 2.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [2]
2 (a) Draw one line from each machine learning category to its most appropriate description.
(b) Describe the purpose of both the A* algorithm and Dijkstra’s algorithm.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [2]
(b) Calculate the path that takes the shortest time to travel from the Begin node to the End node,
using the A* algorithm.
Show your working in the table provided.
12
g=5 Begin
h=8 4 11
A 5
D
6 7
7 C
6 B
8 6
2
8 7
E
5
7 G
End
7 1
4
1 F
Cost from
Destination Heuristic Total
Start node start node
node (h) (f = g + h)
(g)
Begin Begin 0 12 12
Begin A 5 8 13
Final path
[5]
© UCLES 2023 9618/32/M/J/23
3
(b) Explain the problem that occurred in part (a) when representing the number in system 2.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [2]
2 (a) Draw one line from each machine learning category to its most appropriate description.
(b) Describe the purpose of both the A* algorithm and Dijkstra’s algorithm.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [2]
Output
Layer
Input
Layer
Hidden Hidden
Layer 1 Hidden Layer 3
Layer 2
(i) State the reason for having multiple hidden layers in an artificial neural network.
...........................................................................................................................................
..................................................................................................................................... [1]
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
...........................................................................................................................................
..................................................................................................................................... [4]
(b) Find the shortest path between the Home and School nodes using the A* algorithm.
Show your working in the table provided.
14
h = 10 Home 9
g=1 4
A 5 C
3
7
B 6
2
6
D 6
3
7
F
1
2
3
E
3 5
School
Home 0 14 14
A 1 10 11
Final path
[5]