Daily Practice · GCSE Computer Science

October 1975 5-a-day

Every sheet in October 1975

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

  1. 1st October 1975Explain the role of TCP when a large file is downloaded.
  2. 2nd October 1975Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  3. 3rd October 1975A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  4. 4th October 1975Each 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.
  5. 5th October 1975Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  6. 6th October 1975State the two values a Boolean data type can hold.
  7. 7th October 1975Convert the denary number 39 to an 8-bit binary number, showing your working.
  8. 8th October 1975Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  9. 9th October 1975Give one advantage and one disadvantage of using a compiler.
  10. 10th October 1975Convert the hexadecimal number 1A to denary.
  11. 11th October 1975Convert the denary number 156 to an 8 bit binary number.
  12. 12th October 1975Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  13. 13th October 1975Write a loop in pseudocode that outputs every element of a 1D array named names of length 6.
  14. 14th October 1975An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  15. 15th October 1975A 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.
  16. 16th October 1975Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  17. 17th October 1975Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  18. 18th October 1975Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  19. 19th October 1975A 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.
  20. 20th October 1975A user reads the same email on a phone and a tablet, and deleting it on one deletes it on the other. Which protocol is in use and why?
  21. 21st October 1975Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  22. 22nd October 1975A 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.
  23. 23rd October 1975Define the term 'interrupt' as used to describe a signal received by a CPU.
  24. 24th October 1975An 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.
  25. 25th October 1975Evaluate X = NOT A AND B when A = 0 and B = 1.
  26. 26th October 1975Convert the hexadecimal number FF to an 8-bit binary number.
  27. 27th October 1975Give one advantage of a star topology compared with a mesh topology.
  28. 28th October 1975Name the translator used for assembly language and describe how it differs from a compiler.
  29. 29th October 1975Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  30. 30th October 1975State the three stages of the fetch-decode-execute cycle in the order they occur.
  31. 31st October 1975State one weakness of a simple shift cipher compared to modern encryption methods used on networks.