State one category of machine learning.
- (a)State one category of machine learning.[1]
- (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. The first two rows have already been completed. [Figure 12.1][5]
Mark scheme
Marking points from the official mark scheme (May/June 2023). The mark or mark type is shown in brackets.
- [1] One mark from: Supervised (learning) Unsupervised (learning) Reinforcement (learning) Deep (learning)
- [5] One mark for each correct calculation as follows (Max 2): • Node B (from Begin) (Line 3 in table) • Node C (from Begin) (Line 4 in table) • Node D (from Begin) (Line 5 in table) One mark for each correct calculation as follows (Max 2): • Node G (from C) (Line 6 in table) • Node F and Node End (from G) (Lines 7 and 8 in table) • Node End (from F) (Line 9 in table) One mark for correct path (Max 1): • Begin ⇨ C ⇨ G ⇨ F ⇨ End Cost from Start Destination Heuristic Total node node start node (g) (h) (f = g + h) Begin Begin 0 12 12 Begin A 5 8 13 Begin B 6 7 13 Begin C 5 7 12 Begin D 4 11 15 C G 5+2=7 5 12 G F 5+2+4=11 1 12 G End 5+2+7= 14 0 14 F End 5+2+4+1 = 12 0 12 Final Path Begin ⇨ C ⇨ G ⇨ F ⇨ End
Write your answer and get it marked
On Oracle Prep you can write or photograph your own answer and have it marked by AI against this mark scheme, with feedback on what you missed.
Sign up free →