Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
Question 70

A theater booking system uses a 2D grid to track seat statuses. The algorithm shown in Figure 1 searches the grid to locate the coordinates of a seat marked as "Selected".

Figure 1

targetRow = -1
targetCol = -1
for row from 0 to 3
    for col from 0 to 3
        if getSeat(row, col) == "Selected" then
            targetRow = row
            targetCol = col
        endif
    endfor
endfor

Figure 2

Column 0Column 1Column 2Column 3
Row 0AvailableAvailableBookedAvailable
Row 1BookedSelectedAvailableBooked
Row 2AvailableAvailableAvailableAvailable
Row 3BookedAvailableBookedAvailable

Explain the purpose of the second (inner) iteration structure in the algorithm in Figure 1.

[1]
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