Course home

Data structures

Easy Medium

1 2 3 4 5 6 7 8 9 10 11 12 13

Question 12

A programmer is writing an algorithm that uses a record structure to store details about video games.

Complete the algorithm below by filling in the gaps (a) to (d) using the items in Table 1.

You may need to use some of the items in Table 1 more than once.
You will not need to use all the items in Table 1.

Table 1


G1	G2	developer
Game	Real	Integer
title	String	Boolean
rating	Play	Output

Algorithm

RECORD (a)
    title : String
    (b) : String
    rating : (c)
ENDRECORD

G1 ← Game("Minecraft", "Mojang", 9.5)
G2 ← (d) ("Terraria", "Re-Logic", 8.8)

[3]

Markscheme

Data structures Questions

GCSE
Computer Science
Data structures

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

Data structures

Question bank

Data structures

Easy Medium

1 2 3 4 5 6 7 8 9 10 11 12 13

Question 12

A programmer is writing an algorithm that uses a record structure to store details about video games.

Complete the algorithm below by filling in the gaps (a) to (d) using the items in Table 1.

You may need to use some of the items in Table 1 more than once.
You will not need to use all the items in Table 1.

Table 1


G1	G2	developer
Game	Real	Integer
title	String	Boolean
rating	Play	Output

Algorithm

RECORD (a)
    title : String
    (b) : String
    rating : (c)
ENDRECORD

G1 ← Game("Minecraft", "Mojang", 9.5)
G2 ← (d) ("Terraria", "Re-Logic", 8.8)

[3]

Markscheme

Data structures Questions

GCSE
Computer Science
Data structures

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