Daily Practice · GCSE Computer Science

January 1972 5-a-day

Every sheet in January 1972

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

  1. 1st January 1972Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  2. 2nd January 1972Give two reasons why network communication is divided into layers.
  3. 3rd January 1972Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  4. 4th January 1972A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  5. 5th January 1972Each 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.
  6. 6th January 1972Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  7. 7th January 1972State the two values a Boolean data type can hold.
  8. 8th January 1972Convert the denary number 39 to an 8-bit binary number, showing your working.
  9. 9th January 1972Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  10. 10th January 1972Explain why an interpreter is often preferred while a program is being written.
  11. 11th January 1972Convert the hexadecimal number 1A to denary.
  12. 12th January 1972Convert the denary number 156 to an 8 bit binary number.
  13. 13th January 1972Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  14. 14th January 1972A 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.
  15. 15th January 1972An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  16. 16th January 1972A 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.
  17. 17th January 1972Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  18. 18th January 1972Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  19. 19th January 1972Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  20. 20th January 1972A 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.
  21. 21st January 1972State the layer that IP operates in, and describe its job.
  22. 22nd January 1972Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  23. 23rd January 1972A 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.
  24. 24th January 1972Define the term 'interrupt' as used to describe a signal received by a CPU.
  25. 25th January 1972An 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.
  26. 26th January 1972Evaluate X = NOT A AND B when A = 0 and B = 1.
  27. 27th January 1972Convert the hexadecimal number FF to an 8-bit binary number.
  28. 28th January 1972Give one advantage of a star topology compared with a mesh topology.
  29. 29th January 1972Describe what syntax highlighting is and how it helps a programmer.
  30. 30th January 1972Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  31. 31st January 1972State the three stages of the fetch-decode-execute cycle in the order they occur.