Skip to content

Course home

Programming concepts

Programming concepts

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140
Question 130

A programmer is writing an algorithm to search through a collection of books to find the one with the highest page count.

RECORD Book
    title : String
    author : String
    pages : Integer
    isHardback : Boolean
ENDRECORD

book1 ← Book('Neuromancer', 'Gibson', 271, False)
book2 ← Book('Snow Crash', 'Stephenson', 470, False)
book3 ← Book('Foundation', 'Asimov', 255, True)
book4 ← Book('Hyperion', 'Simmons', 482, True)

library ← [book1, book2, book3, book4]
maxPages ← 0
indexFound ← 0

FOR i ← 0 TO L_LIMIT
    IF library[i].pages > maxPages THEN
        maxPages ← library[i].pages
        indexFound ← i
    ENDIF
ENDFOR

OUTPUT library[indexFound].title, ' has the most pages.'

What should the label L_LIMIT in the algorithm be replaced by?

A

444

B

LEN(library)\text{LEN}(\text{library})LEN(library)

C

LEN(library)−1\text{LEN}(\text{library}) - 1LEN(library)−1

D

maxPages\text{maxPages}maxPages

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