,"$L3f",null,{"backHref":"/gcse/computer-science/aqa/questions","basePath":"/gcse/computer-science/aqa/representing-algorithms/questions","formulaUrl":null,"initialIndex":41,"initialQuestionWindow":[{"id":"2533e265-d348-40bb-a5cb-cb3e8e0d5438","revisionId":"fbf06070-6162-4dbb-8eea-d24afa329f26","questionNumber":null,"questionType":"LA","specification":"A robot is placed in a 5x5 grid. The robot's starting position is shown in the grid below by the arrow symbol **▲** at Row 3, Column 3, which indicates it is initially facing North (Up).\n\nBlack squares containing an `[Obstacle]` cannot be moved into.\n\n### Robot Grid\n\n| Row / Col | Column 1 | Column 2 | Column 3 | Column 4 | Column 5 |\n| :--- | :---: | :---: | :---: | :---: | :---: |\n| **Row 1** | | | | | |\n| **Row 2** | | `[Obstacle]` | `[Obstacle]` | | |\n| **Row 3** | `[Obstacle]` | | **▲** (Start) | `[Obstacle]` | |\n| **Row 4** | | | | | |\n| **Row 5** | | | | | |\n\n### Robot Algorithm\n\n```text\nWHILE ObjectAhead() = true\n TurnRight()\n IF ObjectAhead() = true THEN\n TurnLeft()\n TurnLeft()\n ENDIF\n Forward(1)\nENDWHILE\nForward(1)\n```","difficulty":7,"difficultyBand":"medium","totalMarks":3,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"8f3d382e-0764-4cc9-b1de-76ee99d834d2","label":null,"content":"Determine the sequential path of coordinates the robot visits from start to finish. Specify each step in order using the format `(Row, Column)`.","markscheme":"- Identifies the first movement step to $(3, 2)$ B1\n- Identifies the second movement step to $(4, 2)$ B1\n- Identifies the final position step to $(5, 2)$ B1","marks":3,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"26fb39e4-a0d6-4aed-b96c-46820aa83c96","revisionId":"90036ced-e946-439f-b8e0-2bc6a0e3ffce","questionNumber":null,"questionType":"LA","specification":"","difficulty":5,"difficultyBand":"medium","totalMarks":3,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"3fb99dff-a511-462a-b755-e535e2f78241","label":null,"content":"Complete the trace table for the algorithm shown in the flowchart in Figure 1.\n\nYou may not need to use all the rows in the table.\n\n![Algorithm Flowchart](https://assets.mathsgenie.co.uk/aqa-qb/083270ba-fc84-47d4-a597-41874e282cf2.png)\n\n| $a$ | $b$ | $c$ |\n|---|---|---|\n| | | |\n| | | |\n| | | |\n| | | |\n| | | |\n| | | |\n| | | |\n| | | |\n| | | |","markscheme":"- Identifies the initial values $a = 1$ and $b = 5$, calculates the first value of $c = 7$, and correctly updates variables to $a = 6$, $b = 1$ M1\n- Correctly tracks the second and third iterations, showing $c = 13$, updating to $a = 2$, $b = 11$, and then $c = 15$, updating to $a = 12$, $b = 3$ A1\n- Tracks the final iteration, showing $c = 27$ and terminating the algorithm A1\n\n### Completed Trace Table\n\n| $a$ | $b$ | $c$ |\n|---|---|---|\n| 1 | 5 | |\n| | | 7 |\n| 6 | 1 | |\n| | | 13|\n| 2 | 11| |\n| | | 15|\n| 12| 3 | |\n| | | 27|","marks":3,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"270b158f-195c-48b7-8642-b60643d2193c","revisionId":"fe657755-344d-43f0-9e94-b2159eeeff3c","questionNumber":null,"questionType":"LA","specification":"","difficulty":6,"difficultyBand":"medium","totalMarks":4,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"989c0dc3-181d-4213-89c7-1a91b0960fc5","label":null,"content":"Complete the trace table for the algorithm shown in **Figure 1**.\n\nYou may not need to use all the rows in the table.\n\n### Figure 1\n```text\n1 sectors ← ['ZoneA', 'ZoneB', 'ZoneC']\n2 readings ← [15, 23, 8, 41, 12, 19, 34, 11, 27]\n3 accum ← 0\n4 FOR p ← 0 TO 2\n5 loc ← sectors[p]\n6 FOR q ← 0 TO 1\n7 val ← readings[p * 3 + q]\n8 accum ← accum + val\n9 ENDFOR\n10 ENDFOR\n```\n\n|

Representing algorithms

Question 19

Representing algorithms Questions

Representing algorithms

Question 19

Representing algorithms Questions