Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 21

A robot program controls a robot on a 5x5 grid. The columns are labelled A to E (left to right) and the rows are labelled 1 to 5 (top to bottom).

The robot starts in cell (A, 5) facing East (to the right, towards column B), as shown by the arrow in the grid below:

ABCDE
1
2
3
4
5→\rightarrow→

The following program is executed:

Forward(3)
TurnLeft()
Forward(2)
TurnRight()
Forward(1)

Trace the path of the robot. Write down the sequence of grid cell coordinates visited by the robot, starting with its initial position (A, 5) and ending with its final position.

[3]
Markscheme

Representing algorithms Questions

  1. GCSE
  2. /Computer Science
  3. /Representing algorithms

208 exam-style questions on AQA GCSE Computer Science Representing algorithms. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank