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

May 1967 5-a-day

← Today's GCSE Computer Science sheet

May 1967

31 sheets · 155 questions · GCSE

May 1967 compilationAll answers

Every sheet in May 1967

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 1967Each 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.
  2. 2nd May 1967Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  3. 3rd May 1967State the two values a Boolean data type can hold.
  4. 4th May 1967State how many different values can be represented using 5 bits, and explain your reasoning.
  5. 5th May 1967Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  6. 6th May 1967Describe what syntax highlighting is and how it helps a programmer.
  7. 7th May 1967Convert the hexadecimal number 1A to denary.
  8. 8th May 1967Convert the denary number 156 to an 8 bit binary number.
  9. 9th May 1967Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  10. 10th May 1967Trace this algorithm with data = [4, 9, 2, 9, 7] and state the final output. total = 0; count = 0; for i = 0 to 4: if data[i] > 5 then total = total + data[i] and count = count + 1; next i; print(total, count).
  11. 11th May 1967An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  12. 12th May 1967A 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.
  13. 13th May 1967Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  14. 14th May 1967Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  15. 15th May 1967State the key difference between a procedure and a function.
  16. 16th May 1967A 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.
  17. 17th May 1967Explain the role of TCP when a large file is downloaded.
  18. 18th May 1967Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  19. 19th May 1967Give one advantage of a relational database over a flat-file database.
  20. 20th May 1967Define the term 'interrupt' as used to describe a signal received by a CPU.
  21. 21st May 1967An 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.
  22. 22nd May 1967Evaluate X = NOT A AND B when A = 0 and B = 1.
  23. 23rd May 1967Convert the hexadecimal number 3F to denary.
  24. 24th May 1967Give one advantage of a star topology compared with a mesh topology.
  25. 25th May 1967Give one advantage and one disadvantage of using a compiler.
  26. 26th May 1967Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  27. 27th May 1967State the three stages of the fetch-decode-execute cycle in the order they occur.
  28. 28th May 1967State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  29. 29th May 1967Write a loop in pseudocode that outputs every element of a 1D array named names of length 6.
  30. 30th May 1967Define the term 'pixel'.
  31. 31st May 1967Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.