Daily Practice · GCSE Computer Science

April 1963 5-a-day

Every sheet in April 1963

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 1963State one example of a file format that commonly uses lossy compression.
  2. 2nd April 1963State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  3. 3rd April 1963State whether the source code of proprietary (closed source) software is normally available for the public to view.
  4. 4th April 1963Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  5. 5th April 1963A programmer wants any syntax error in their program to be reported before the program starts running at all. State whether a compiler or an interpreter behaves this way, and explain why.
  6. 6th April 1963Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  7. 7th April 1963Give two reasons why network communication is divided into layers.
  8. 8th April 1963Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  9. 9th April 1963A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  10. 10th April 1963Each 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.
  11. 11th April 1963Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  12. 12th April 1963State the two values a Boolean data type can hold.
  13. 13th April 1963Convert the denary number 39 to an 8-bit binary number, showing your working.
  14. 14th April 1963Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  15. 15th April 1963Explain why an interpreter is often preferred while a program is being written.
  16. 16th April 1963Convert the hexadecimal number 1A to denary.
  17. 17th April 1963Convert the denary number 156 to an 8 bit binary number.
  18. 18th April 1963Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  19. 19th April 1963A 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.
  20. 20th April 1963An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  21. 21st April 1963A 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.
  22. 22nd April 1963Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  23. 23rd April 1963Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  24. 24th April 1963Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  25. 25th April 1963A 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.
  26. 26th April 1963State the layer that IP operates in, and describe its job.
  27. 27th April 1963Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  28. 28th April 1963A 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.
  29. 29th April 1963Define the term 'interrupt' as used to describe a signal received by a CPU.
  30. 30th April 1963An 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.