Revision Library
Choose a subject
Menu
Computer Science
Need a new topic?
Missing a topic, found a bug, or want something added?

GCSE Computer Science Topic Workbooks · Book 1 of 2

GCSE Computer Science Topic Workbook 1

Systems Architecture, Memory and Primary Storage, Secondary Storage and 7 more

Level
GCSE · AQA 8525 · OCR J277
Series
GCSE Computer Science Topic Workbooks, book 1 of 2
Suitable for
Years 10-11, AQA / OCR
FreePDF download · 2027 edition · 114 A4 pages
  • One file, prints straight to A4
  • No account, no password

Workbooks like this one, with 10 topics, 160 questions and mark schemes at the back, are usually printed and sold by publishers. This one is one of 558 free PDFs on the shelf.

Pages
114 A4 pages
Chapters
10 worksheet chapters
Questions
160 · 657 marks
Answers
From page 84
Working time
About 12h 30m

What is inside

10 chapters · answers from p84

Each chapter starts with a page showing its marks and a suggested time, followed by the questions. The mark schemes for all 10 chapters are at the back, so the book works for homework, a timed test or revision.

  1. 01Systems Architecture14 questions · 49 marks · about 55 min Topic guide: Systems Architecturep3
  2. 02Memory and Primary Storage20 questions · 63 marks · about 70 min Topic guide: Memory and Primary Storagep9
  3. 03Secondary Storage14 questions · 55 marks · about 65 min Topic guide: Secondary Storagep18
  4. 04System Software18 questions · 71 marks · about 80 min Topic guide: System Softwarep24
  5. 05Networks and Topologies15 questions · 79 marks · about 90 min Topic guide: Networks and Topologiesp31
  6. 06Network Security14 questions · 62 marks · about 70 min Topic guide: Network Securityp43
  7. 07Ethical, Legal, Cultural and Environmental Impact15 questions · 65 marks · about 75 min Topic guide: Ethical, Legal, Cultural and Environmental Impactp51
  8. 08Network Protocols and Layers17 questions · 58 marks · about 65 min Topic guide: Network Protocols and Layersp58
  9. 09Algorithms16 questions · 73 marks · about 85 min Topic guide: Algorithmsp65
  10. 10Programming Fundamentals17 questions · 82 marks · about 95 min Topic guide: Programming Fundamentalsp74
  11. AnswersMark schemes for every chapterp84

Each chapter is drawn from one of our worksheet packs. Follow a chapter title for the full pack on its own page, or browse every GCSE Computer Science pack. Every book on the shelf is a complete printable workbook of up to 120 A4 pages.

Explore this volume

GCSE Computer Science Topic Workbook 1 includes Systems Architecture (from page 3); Memory and Primary Storage (from page 9); Secondary Storage (from page 18); System Software (from page 24); Networks and Topologies (from page 31); Network Security (from page 43); Ethical, Legal, Cultural and Environmental Impact (from page 51); Network Protocols and Layers (from page 58); Algorithms (from page 65); Programming Fundamentals (from page 74).

Worked question 19 - Memory and Primary Storage

Open the included worksheet

A student upgrades their laptop's RAM from 8 GB to 16 GB, hoping this will make their laptop run much faster.

Discuss the likely effect of this upgrade on the laptop's performance, and explain the circumstances in which further increasing the RAM would provide little or no additional benefit.

In your answer you should refer to:
- the relationship between RAM size, secondary storage use and performance
- the role of the CPU and cache in overall performance
- the idea of diminishing returns

Answer and mark scheme

Question 19

CreditAnswer or working
1-2Level 1 Basic, isolated statement(s), e.g. 'more RAM makes it faster', with little or no justification. Limited or no use of appropriate technical terms. Answer is not clearly linked to the scenario.
3-4Level 2 Shows some understanding of how RAM size affects performance (e.g. reduces reliance on slower virtual memory/secondary storage), with some justification. The discussion may be one-sided or not fully developed, and diminishing returns/the role of the CPU and cache may be only briefly mentioned. Some appropriate technical terms used.
5-6Level 3 A coherent, well-developed discussion that explains how increasing RAM reduces reliance on (slower) virtual memory up to a point, and explains that once RAM is large enough to hold everything the CPU currently needs, further increases give diminishing returns because performance is then limited by other components such as the CPU and cache. The answer is logically structured and uses appropriate technical terminology throughout.
  • Indicative content:
    • Before the upgrade, if 8 GB of RAM was often full, the operating system would have to use virtual memory (secondary storage) to store data that did not fit in RAM
    • Secondary storage (HDD/SSD) is much slower to access than RAM, so relying on virtual memory slows the computer down
    • Increasing RAM to 16 GB means more data/programs can be held in RAM at once, reducing how often virtual memory is needed
    • This is likely to noticeably improve performance if the laptop was previously running out of RAM
    • However, if the tasks the student runs never actually needed more than 8 GB, having 16 GB gives little or no extra benefit (diminishing returns)
    • Overall performance also depends on the CPU (clock speed, number of cores) and cache size, not just the amount of RAM
    • If the CPU itself is slow, or the cache is small, adding more RAM will not fix these bottlenecks
    • Therefore performance gains from adding RAM depend on what was actually limiting performance beforehand

Answer: Level 3 response expected: increasing RAM reduces virtual memory use (improving performance) up to the point where RAM already meets demand, after which further RAM gives diminishing returns because the CPU/cache become the limiting factor.

Question 18 - Memory and Primary Storage

Open the included worksheet

Registers inside the CPU are much faster to access than RAM. Explain why registers cannot be used to store all of the data and instructions needed by a currently running program, instead of RAM.

Answer and mark scheme

Question 18

CreditAnswer or working
B1registers have an extremely small capacity (each register can typically only hold one value/a very small amount of data)
B1so RAM (with a much larger capacity) is needed to hold the full program and its data, with only small amounts moved into registers when the CPU needs them
  • Answer: Registers can hold only tiny amounts of data each, so RAM (far larger capacity) is needed to store the whole running program, with data moved into registers only as needed.

Question 13 - Memory and Primary Storage

Open the included worksheet

A programmer writes the following algorithm to check whether some file sizes (in bytes) count as 'Large' or 'Small'.
fileSizes = [500000, 2000000, 15000000]
FOR i = 0 TO 2
    sizeInMB = fileSizes[i] / 1000000
    IF sizeInMB >= 1 THEN
        OUTPUT "Large"
    ELSE
        OUTPUT "Small"
    ENDIF
NEXT i

Complete the trace table to show the values of i, fileSizes[i] and sizeInMB, and the output produced, as the algorithm executes.
i fileSizes[i] sizeInMB Output

Answer and mark scheme

Question 13

CreditAnswer or working
B1row i = 0: fileSizes[i] = 500000, sizeInMB = 0.5, Output = Small, all correct
B1row i = 1: fileSizes[i] = 2000000, sizeInMB = 2, Output = Large, all correct
B1row i = 2: fileSizes[i] = 15000000, sizeInMB = 15, Output = Large, all correct
B1the loop counter i shown correctly incrementing 0, 1, 2 across the three rows
  • Answer: i=0: fileSizes[i]=500000, sizeInMB=0.5, Output=Small | i=1: fileSizes[i]=2000000, sizeInMB=2, Output=Large | i=2: fileSizes[i]=15000000, sizeInMB=15, Output=Large

Question 9 - Algorithms

Open the included worksheet

A sorted array called nums, in ascending order, contains: [3, 9, 14, 22, 27, 35, 41, 48, 55, 62] at indices 0 to 9.
(a)State the condition that must be met before a binary search can be used on this array.(1)
(b)A binary search uses mid <- (lower + upper) DIV 2 to find the middle index at each step. Complete a trace table to show the values of lower, upper and mid, and the outcome of each comparison, as a binary search locates the value 41.(5)
(c)State the number of comparisons made to find the value using binary search in part (b), and explain why this is fewer than a linear search would need in the worst case for this array.(2)

Answer and mark scheme

Question 9

CreditAnswer or working
B1(a) the data/array must already be sorted (into ascending or descending order) (oe)
B1(b) step 1: lower=0, upper=9, mid=4, nums[4]=27, 41>27 so search upper half (lower<-5)
B1(b) step 2: lower=5, upper=9, mid=7, nums[7]=48, 41<48 so search lower half (upper<-6)
B1(b) step 3: lower=5, upper=6, mid=5, nums[5]=35, 41>35 so search upper half (lower<-6)
B1(b) step 4: lower=6, upper=6, mid=6, nums[6]=41, value found
B1(b) all four steps correct and consistent with each other (cao)
B1(c) 4 comparisons were made (ft from part b)
B1(c) binary search eliminates half of the remaining items at each step, whereas a linear search worst case would need to check all 10 items one at a time (oe)
  • (a) Answer: The array must be sorted (in ascending or descending order).
  • (b) Answer: Step1: mid=4 (27), search upper. Step2: mid=7 (48), search lower. Step3: mid=5 (35), search upper. Step4: mid=6 (41), found at index 6.
  • (c) Answer: 4 comparisons; binary search halves the remaining data each time, so it needs far fewer comparisons than the worst-case 10 needed by a linear search.

Question 13 - Algorithms

Open the included worksheet

A programmer compares linear search and binary search on datasets of different sizes.
(a)Explain why the difference in efficiency between linear search and binary search becomes more significant as the size of the dataset increases.(3)
(b)Calculate the maximum number of comparisons required by a binary search on a sorted list of 1024 items.(2)

Answer and mark scheme

Question 13

CreditAnswer or working
B1(a) a linear search checks items one at a time, so its worst-case number of comparisons is directly proportional to the number of items, n (oe)
B1(a) a binary search halves the remaining data at each step, so its worst-case number of comparisons grows much more slowly, proportional to log2(n) (oe)
B1(a) as n grows very large, linear search's comparisons increase proportionally while binary search's increase only logarithmically, so the performance gap widens (oe)
M1(b) recognises that 1024 = 210, or shows repeated halving of 1024 down to 1
A1(b) 10 or 11 (cao; 11 is exact when the last remaining item must also be compared, 10 counts the halving steps)
  • (a) Answer: Linear search's worst-case comparisons grow directly with the size of the dataset, while binary search's grow only logarithmically (halving each time), so binary search becomes proportionally far faster as the dataset gets larger.
  • (b) Answer: 10 (11 is also correct)

GCSE Computer Science Topic Workbooks runs to 2 volumes

Book 1 of 2 · 223 pages in the set

Each book is a separate free PDF.

Volume 1 · this book

114 pp · 160 Qs

Systems Architecture, Memory and Primary Storage, Secondary Storage and 7 more

Volume 2

109 pp · 137 Qs

Producing Robust Programs, Boolean Logic, Data Representation: Number Systems and 6 more

More GCSE books

Want a different mix of topics?

Sitting an exam soon? Build a GCSE Computer Science mock paper or print a ready-made one.