Daily Practice · GCSE Computer Science

October 1985 5-a-day

Every sheet in October 1985

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 1985State the two values a Boolean data type can hold.
  2. 2nd October 1985Convert the denary number 39 to an 8-bit binary number, showing your working.
  3. 3rd October 1985Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  4. 4th October 1985A program compiles and runs but always outputs an average that is too small. State the type of error and explain why the translator did not report it.
  5. 5th October 1985Convert the hexadecimal number 1A to denary.
  6. 6th October 1985Convert the denary number 156 to an 8 bit binary number.
  7. 7th October 1985Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  8. 8th October 1985An array named temps holds 12 values. State the index of the first item and the index of the last item.
  9. 9th October 1985An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  10. 10th October 1985A 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.
  11. 11th October 1985Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  12. 12th October 1985Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  13. 13th October 1985Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  14. 14th October 1985A 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.
  15. 15th October 1985State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  16. 16th October 1985Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  17. 17th October 1985A 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.
  18. 18th October 1985Define the term 'interrupt' as used to describe a signal received by a CPU.
  19. 19th October 1985An 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.
  20. 20th October 1985Evaluate X = NOT A AND B when A = 0 and B = 1.
  21. 21st October 1985Convert the hexadecimal number FF to an 8-bit binary number.
  22. 22nd October 1985Give one advantage of a star topology compared with a mesh topology.
  23. 23rd October 1985State why a program written in a high level language must be translated.
  24. 24th October 1985Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  25. 25th October 1985State the three stages of the fetch-decode-execute cycle in the order they occur.
  26. 26th October 1985State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  27. 27th October 1985Describe what a nested loop does when it processes a 2D array.
  28. 28th October 1985Define the term 'pixel'.
  29. 29th October 1985Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  30. 30th October 1985Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  31. 31st October 1985Evaluate the expression 23 DIV 4.