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

May 1987 5-a-day

← Today's GCSE Computer Science sheet

May 1987

31 sheets · 155 questions · GCSE

May 1987 compilationAll answers

Every sheet in May 1987

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 1987A 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.
  2. 2nd May 1987An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  3. 3rd May 1987A 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.
  4. 4th May 1987Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  5. 5th May 1987Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  6. 6th May 1987State the key difference between a procedure and a function.
  7. 7th May 1987A 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.
  8. 8th May 1987State the layer that IP operates in, and describe its job.
  9. 9th May 1987Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  10. 10th May 1987Give one advantage of a relational database over a flat-file database.
  11. 11th May 1987Define the term 'interrupt' as used to describe a signal received by a CPU.
  12. 12th May 1987An 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.
  13. 13th May 1987Evaluate X = NOT A AND B when A = 0 and B = 1.
  14. 14th May 1987Convert the hexadecimal number 3F to denary.
  15. 15th May 1987Give one advantage of a star topology compared with a mesh topology.
  16. 16th May 1987Describe what syntax highlighting is and how it helps a programmer.
  17. 17th May 1987Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  18. 18th May 1987State the three stages of the fetch-decode-execute cycle in the order they occur.
  19. 19th May 1987State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  20. 20th May 1987Trace 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).
  21. 21st May 1987Define the term 'pixel'.
  22. 22nd May 1987Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  23. 23rd May 1987Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  24. 24th May 1987Evaluate the expression 23 DIV 4.
  25. 25th May 1987A 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.
  26. 26th May 1987A 1 TB hard disk drive costs 40 pounds. A 500 GB solid-state drive costs 60 pounds. Calculate the cost per gigabyte of each device, and state which is cheaper per GB. Use 1 TB = 1000 GB.
  27. 27th May 1987Explain the role of TCP when a large file is downloaded.
  28. 28th May 1987A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  29. 29th May 1987A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  30. 30th May 1987A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  31. 31st May 1987An array contains [9, 2, 6], to be sorted using insertion sort. Show the state of the array after each new element has been inserted into its correct position.