Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 91

Complete the trace table for the subroutine call transform(60).

You may not need to use all the rows in the table.

SUBROUTINE transform(n)
  a ← n
  b ← 2
  REPEAT
    a ← a DIV 2
    b ← b * 2
  UNTIL a ≤ 3
  OUTPUT b
ENDSUBROUTINE
nabOUTPUT
60
[4]
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