Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 42

An algorithm is represented by the following pseudo-code:

1  active ← True
2  WHILE active = True
3      val ← USERINPUT
4      IF val > 3 THEN
5          trips ← 0
6          WHILE val > 3
7              val ← (val DIV 3) + 1
8              trips ← trips + 1
9          ENDWHILE
10     ELSE
11         active ← False
12     ENDIF
13     OUTPUT val
14 ENDWHILE

What is the value of the variable trips immediately after the inner WHILE loop finishes when the user input is 240?

A

333

B

444

C

555

D

666

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