Revision Library
/Subjects/Computer Science/Daily Practice
Daily Practice · GCSE Computer Science

April 1983 5-a-day

← Today's GCSE Computer Science sheet

April 1983

30 sheets · 150 questions · GCSE

April 1983 compilationAll answers

Every sheet in April 1983

The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.

  1. 1st April 1983Each pair from the previous question is stored using 2 bytes. Calculate the compression ratio achieved, given the uncompressed row (1 byte per pixel) uses 8 bytes.
  2. 2nd April 1983Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  3. 3rd April 1983State the two values a Boolean data type can hold.
  4. 4th April 1983Convert the denary number 39 to an 8-bit binary number, showing your working.
  5. 5th April 1983Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  6. 6th April 1983State why a program written in a high level language must be translated.
  7. 7th April 1983Convert the hexadecimal number 1A to denary.
  8. 8th April 1983Convert the denary number 156 to an 8 bit binary number.
  9. 9th April 1983Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  10. 10th April 1983Describe what a nested loop does when it processes a 2D array.
  11. 11th April 1983An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  12. 12th April 1983A CPU's cache has a hit rate of 80%. During a task the CPU makes 4000 requests for data. Calculate the number of cache hits and cache misses.
  13. 13th April 1983Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  14. 14th April 1983Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  15. 15th April 1983Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  16. 16th April 1983A company backs up its files onto magnetic tape cartridges, each with a capacity of 3 TB. The company needs to back up 20 TB of data. Calculate the minimum number of cartridges needed.
  17. 17th April 1983Give two reasons why network communication is divided into layers.
  18. 18th April 1983Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  19. 19th April 1983A table called members has fields memberId, firstName, lastName and joinYear. Write an SQL statement that adds a new record with memberId 12, firstName 'Priya', lastName 'Shah' and joinYear 2026.
  20. 20th April 1983Define the term 'interrupt' as used to describe a signal received by a CPU.
  21. 21st April 1983An array called items contains [12, 45, 7, 30, 19] at indices 0 to 4. Describe how a linear search would locate the value 30, stating the number of comparisons needed.
  22. 22nd April 1983Evaluate X = NOT A AND B when A = 0 and B = 1.
  23. 23rd April 1983Convert the hexadecimal number FF to an 8-bit binary number.
  24. 24th April 1983Give one advantage of a star topology compared with a mesh topology.
  25. 25th April 1983Explain why an interpreter is often preferred while a program is being written.
  26. 26th April 1983Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  27. 27th April 1983State the three stages of the fetch-decode-execute cycle in the order they occur.
  28. 28th April 1983State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  29. 29th April 1983A 2D array grid is declared as grid[4][6]. State how many rows and columns it has and how many elements it holds in total.
  30. 30th April 1983Define the term 'pixel'.