Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 24

An algorithm designed to monitor a cargo weight limit is shown below:

1  total_weight ← 0
2  item_count ← 0
3  limit_reached ← False
4  IF total_weight < 50 THEN
5      WHILE limit_reached = False AND item_count < 10
6          item_weight ← GET_ITEM_WEIGHT()
7          IF total_weight + item_weight > 50 THEN
8              limit_reached ← True
9          ELSE
10             total_weight ← total_weight + item_weight
11             item_count ← item_count + 1
12         ENDIF
13     ENDWHILE
14 ENDIF

Where is iteration first used in this algorithm?

A

Line 444

B

Line 555

C

Line 777

D

Line 101010

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