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

May 1972 5-a-day

← Today's GCSE Computer Science sheet

May 1972

31 sheets · 155 questions · GCSE

May 1972 compilationAll answers

Every sheet in May 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 May 1972State how many different values can be represented using 5 bits, and explain your reasoning.
  2. 2nd May 1972Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  3. 3rd May 1972State why a program written in a high level language must be translated.
  4. 4th May 1972Convert the hexadecimal number 1A to denary.
  5. 5th May 1972Convert the denary number 156 to an 8 bit binary number.
  6. 6th May 1972Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  7. 7th May 1972Describe what a nested loop does when it processes a 2D array.
  8. 8th May 1972An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  9. 9th May 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.
  10. 10th May 1972Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  11. 11th May 1972Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  12. 12th May 1972State the key difference between a procedure and a function.
  13. 13th May 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.
  14. 14th May 1972Give two reasons why network communication is divided into layers.
  15. 15th May 1972Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  16. 16th May 1972Give one advantage of a relational database over a flat-file database.
  17. 17th May 1972Define the term 'interrupt' as used to describe a signal received by a CPU.
  18. 18th May 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.
  19. 19th May 1972Evaluate X = NOT A AND B when A = 0 and B = 1.
  20. 20th May 1972Convert the hexadecimal number 3F to denary.
  21. 21st May 1972Give one advantage of a star topology compared with a mesh topology.
  22. 22nd May 1972Explain why an interpreter is often preferred while a program is being written.
  23. 23rd May 1972Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  24. 24th May 1972State the three stages of the fetch-decode-execute cycle in the order they occur.
  25. 25th May 1972State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  26. 26th May 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.
  27. 27th May 1972Define the term 'pixel'.
  28. 28th May 1972Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  29. 29th May 1972Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  30. 30th May 1972Evaluate the expression 23 DIV 4.
  31. 31st May 1972A 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.