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

January 2012 - GCSE Computer Science 5-a-day

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

← Today's GCSE Computer Science sheet

January 2012

31 sheets · 155 questions · GCSE

January 2012 compilationAll answers

Every sheet in January 2012

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 2012Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  2. 2nd January 2012A 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.
  3. 3rd January 2012State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  4. 4th January 2012Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  5. 5th January 2012A 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.
  6. 6th January 2012Define the term 'interrupt' as used to describe a signal received by a CPU.
  7. 7th January 2012An 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.
  8. 8th January 2012Evaluate X = NOT A AND B when A = 0 and B = 1.
  9. 9th January 2012Convert the hexadecimal number FF to an 8-bit binary number.
  10. 10th January 2012Give one advantage of a star topology compared with a mesh topology.
  11. 11th January 2012State why a program written in a high level language must be translated.
  12. 12th January 2012Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  13. 13th January 2012State the three stages of the fetch-decode-execute cycle in the order they occur.
  14. 14th January 2012State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  15. 15th January 2012Describe what a nested loop does when it processes a 2D array.
  16. 16th January 2012Define the term 'pixel'.
  17. 17th January 2012Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  18. 18th January 2012Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  19. 19th January 2012Evaluate the expression 23 DIV 4.
  20. 20th January 2012State the correct order of the three operations used to read data from a text file.
  21. 21st January 2012A 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.
  22. 22nd January 2012Give two reasons why network communication is divided into layers.
  23. 23rd January 2012A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  24. 24th January 2012A 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.
  25. 25th January 2012A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  26. 26th January 2012An 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.
  27. 27th January 2012Complete: NOT 0 = ?
  28. 28th January 2012Convert the denary number 200 to hexadecimal, showing your working.
  29. 29th January 2012State what LAN stands for.
  30. 30th January 2012Explain why an interpreter is often preferred while a program is being written.
  31. 31st January 2012An 8-bit register stores the value 01100000 (denary 96). State the resulting 8-bit binary value after a left shift by 1 place, and state whether an overflow occurs.