May/June 2026 Paper 32

2026 · 11 questions · 26 parts · 75 marks

0/75 marks

0Correct0Partial0Wrong26Unattempted

Filters0 active

Questions

Select a part to jump to its question

1(a)1(b)(i)1(b)(ii)

–/5 mks

–/4 mks

–/5 mks

–/6 mks

–/4 mks

–/9 mks

7(a)(i)7(a)(ii)7(a)(iii)7(b)

–/8 mks

–/7 mks

9(a)9(b)(i)9(b)(ii)

–/9 mks

–/9 mks

–/9 mks

9(a)Neural Networks Deep LearningEasy1 mark

State the subset of Artificial Intelligence (AI) which makes use of an artificial neural network.

9(b)(i)Search Planning Intelligent AgentsMedium3 marks

The A* and Dijkstra’s algorithms are used to perform searches on a graph.

Outline how the A* algorithm is different from Dijkstra’s algorithm.

Answer

0 words

9(b)(ii)Graphs Graph AlgorithmsHard5 marks

Calculate the best path between the Home node and each of the nodes in the diagram using Dijkstra’s algorithm. Show your working, and give your answer for each node below.

Weighted network diagram for Dijkstra's algorithm with seven nodes: Home, A, B, C, D, E and F. Edges and their weights: Home-A 6, Home-F 16, A-B 8, A-C 3, A-F 8, B-C 4, C-D 12, D-F 6, D-E 7, F-E 3

Working

0 words