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

January 2007 - GCSE Computer Science 5-a-day

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

← Today's GCSE Computer Science sheet

January 2007

31 sheets · 155 questions · GCSE

January 2007 compilationAll answers

Every sheet in January 2007

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

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