May/June 2026 Paper 31

2026 · 11 questions · 28 parts · 75 marks

0/75 marks

0Correct0Partial0Wrong28Unattempted

Filters0 active

Questions

Select a part to jump to its question

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

–/5 mks

–/6 mks

–/6 mks

–/4 mks

–/4 mks

6(a)6(b)6(c)(i)6(c)(ii)

–/9 mks

–/9 mks

8(a)(i)8(a)(ii)8(b)

–/6 mks

–/9 mks

10(a)10(b)10(c)

–/9 mks

11(a)11(b)11(c)

–/8 mks

9(a)Supervised LearningHard4 marks

Explain how supervised learning and unsupervised learning are trained.

Answer

0 words

9(b)Graphs Graph AlgorithmsHard5 marks

Calculate the best path between the Begin node and each of the nodes in the diagram using Dijkstra's algorithm. Show your working and write your answers in the table provided.

Weighted network diagram for Dijkstra's algorithm with seven nodes: Begin, P, Q, R, S, T and U. Edges and their weights: Begin-P 9, Begin-R 6, Begin-U 21, P-Q 5, P-R 2, Q-S 5, R-S 8, S-T 3, S-U 6, U-T 4.

Working

0 words