Daily Practice · GCSE Computer Science

July 2004 - GCSE Computer Science 5-a-day

Every GCSE Computer Science sheet published in July 2004, with answers. Systems, data representation, networks, algorithms and programming.

Every sheet in July 2004

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

  1. 1st July 2004An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  2. 2nd July 2004A 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.
  3. 3rd July 2004Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  4. 4th July 2004Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  5. 5th July 2004Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  6. 6th July 2004A 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.
  7. 7th July 2004Explain the role of TCP when a large file is downloaded.
  8. 8th July 2004Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  9. 9th July 2004A 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.
  10. 10th July 2004Define the term 'interrupt' as used to describe a signal received by a CPU.
  11. 11th July 2004An 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.
  12. 12th July 2004Evaluate X = NOT A AND B when A = 0 and B = 1.
  13. 13th July 2004Convert the hexadecimal number FF to an 8-bit binary number.
  14. 14th July 2004Give one advantage of a star topology compared with a mesh topology.
  15. 15th July 2004Give one advantage and one disadvantage of using a compiler.
  16. 16th July 2004Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  17. 17th July 2004State the three stages of the fetch-decode-execute cycle in the order they occur.
  18. 18th July 2004State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  19. 19th July 2004Write a loop in pseudocode that outputs every element of a 1D array named names of length 6.
  20. 20th July 2004Define the term 'pixel'.
  21. 21st July 2004Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  22. 22nd July 2004Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  23. 23rd July 2004Evaluate the expression 23 DIV 4.
  24. 24th July 2004State the correct order of the three operations used to read data from a text file.
  25. 25th July 2004A 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.
  26. 26th July 2004A 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?
  27. 27th July 2004A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  28. 28th July 2004A table called products has fields productId, name, price and stock. Write an SQL statement that changes the price of the product with productId 7 to 15.99.
  29. 29th July 2004A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  30. 30th July 2004An 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.
  31. 31st July 2004Complete: NOT 0 = ?