Daily Practice · GCSE Computer Science
January 2002 - GCSE Computer Science 5-a-day
Every GCSE Computer Science sheet published in January 2002, with answers. Systems, data representation, networks, algorithms and programming.
Every sheet in January 2002
The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.
- 1st January 2002An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
- 2nd January 2002A 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.
- 3rd January 2002Describe two negative consequences of throwing away old computer hardware instead of recycling it.
- 4th January 2002Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
- 5th January 2002Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
- 6th January 2002A 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.
- 7th January 2002A 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?
- 8th January 2002Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
- 9th January 2002A 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.
- 10th January 2002Define the term 'interrupt' as used to describe a signal received by a CPU.
- 11th January 2002An 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.
- 12th January 2002Evaluate X = NOT A AND B when A = 0 and B = 1.
- 13th January 2002Convert the hexadecimal number FF to an 8-bit binary number.
- 14th January 2002Give one advantage of a star topology compared with a mesh topology.
- 15th January 2002Name the translator used for assembly language and describe how it differs from a compiler.
- 16th January 2002Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
- 17th January 2002State the three stages of the fetch-decode-execute cycle in the order they occur.
- 18th January 2002State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
- 19th January 2002Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
- 20th January 2002Define the term 'pixel'.
- 21st January 2002Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
- 22nd January 2002Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
- 23rd January 2002Evaluate the expression 23 DIV 4.
- 24th January 2002State the correct order of the three operations used to read data from a text file.
- 25th January 2002A 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.
- 26th January 2002Define the term protocol.
- 27th January 2002A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
- 28th January 2002A 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.
- 29th January 2002A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
- 30th January 2002An 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.
- 31st January 2002Complete: NOT 0 = ?