Daily Practice · GCSE Computer Science

October 2000 - GCSE Computer Science 5-a-day

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

Every sheet in October 2000

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 2000Describe what a nested loop does when it processes a 2D array.
  2. 2nd October 2000An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  3. 3rd October 2000A 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 October 2000Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  5. 5th October 2000Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  6. 6th October 2000Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  7. 7th October 2000A 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 October 2000Give two reasons why network communication is divided into layers.
  9. 9th October 2000Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  10. 10th October 2000A 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.
  11. 11th October 2000Define the term 'interrupt' as used to describe a signal received by a CPU.
  12. 12th October 2000An 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 October 2000Evaluate X = NOT A AND B when A = 0 and B = 1.
  14. 14th October 2000Convert the hexadecimal number FF to an 8-bit binary number.
  15. 15th October 2000Give one advantage of a star topology compared with a mesh topology.
  16. 16th October 2000Explain why an interpreter is often preferred while a program is being written.
  17. 17th October 2000Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  18. 18th October 2000State the three stages of the fetch-decode-execute cycle in the order they occur.
  19. 19th October 2000State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  20. 20th October 2000A 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.
  21. 21st October 2000Define the term 'pixel'.
  22. 22nd October 2000Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  23. 23rd October 2000Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  24. 24th October 2000Evaluate the expression 23 DIV 4.
  25. 25th October 2000State the correct order of the three operations used to read data from a text file.
  26. 26th October 2000A 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 October 2000State the layer that IP operates in, and describe its job.
  28. 28th October 2000A '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 October 2000A 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.
  30. 30th October 2000A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  31. 31st October 2000An 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.