Skip to content

Course home

Programming concepts

Programming concepts

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140
Question 57

An algorithm, written using pseudo-code, utilizes a RECORD data structure to store information about a fleet of electric vehicles.

Figure 1

RECORD Car
    make : String
    model : String
    mileage : Integer
    electric : Boolean
ENDRECORD

car1 ← Car('Tesla', 'Model 3', 12000, True)
car2 ← Car('Nissan', 'Leaf', 45000, True)
car3 ← Car('BMW', 'i3', 31000, True)
car4 ← Car('Renault', 'Zoe', 18000, True)
electricFleet ← [car1, car2, car3, car4]

maxMileage ← -1
indexUsed ← 0

FOR i ← 0 TO X1
    IF electricFleet[i].mileage > maxMileage THEN
        maxMileage ← electricFleet[i].mileage
        indexUsed ← i
    ENDIF
ENDFOR

OUTPUT electricFleet[indexUsed].model, ' has the highest mileage'

What should the label X1 in Figure 1 be replaced by?

A

4

B

LEN(electricFleet)

C

LEN(electricFleet) - 1

D

indexUsed

Markscheme

Programming concepts Questions

  1. GCSE
  2. /Computer Science
  3. /Programming concepts

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

Question bank