May/June 2026 Paper 33

2026 · 11 questions · 26 parts · 75 marks

0/75 marks

0Correct0Partial0Wrong26Unattempted

Filters0 active

Questions

Select a part to jump to its question

–/5 mks

–/4 mks

–/6 mks

–/5 mks

–/7 mks

6(a)(i)6(a)(ii)6(a)(iii)6(b)

–/8 mks

–/9 mks

–/6 mks

–/8 mks

10(a)(i)10(a)(ii)10(b)

–/9 mks

–/8 mks

9(a)Supervised LearningMedium3 marks

Explain what is meant by regression methods in relation to machine learning.

Answer

0 words

9(b)Search Planning Intelligent AgentsHard5 marks

The A* algorithm is used to perform searches on a graph.

Weighted graph with nodes W (h=18), N1 (h=15), N2 (h=14), N3 (h=13), N6 (h=3), N5 (h=7), N4 (h=9) and E (h=0, the goal). Edges and their costs: W-N1 6 (labelled g=6), W-N2 4, W-N3 7, N1-N6 12, N1-N2 3, N2-N3 2, N2-N5 7, N3-N4 4, N6-N5 4, N6-E 3, N5-E 11, N5-N4 2, N4-E 12

Calculate the best path between the W and E nodes on the following diagram using the A* algorithm. Show your working in the table provided. The first two rows have been done for you.

Diagram to annotate

Draw with the mouse or a finger.