Skip to content

Course home

Representing algorithms

Representing algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
Question 84

A marine biologist has defined a record structure Whale to store details about tracked whales.

RECORD Whale
    whaleID : String
    lastSighted : String
    migrationDistance : Real
ENDRECORD

W1 ← Whale("Orca-92", "Pacific Ocean", 4520.8)
W2 ← Whale("Blue-11", "Indian Ocean", 4110.3)

Write an algorithm using pseudo-code to display the ID of the whale with the longest migration distance.

The algorithm should:

  • compare the migration distance of W1 and W2
  • output the whale ID of the whale with the greatest migration distance
  • output Tie if both whales have the same migration distance

The algorithm should work for any valid whale records stored in W1 and W2.

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