Daily Practice · GCSE Computer Science
December 2002 - GCSE Computer Science 5-a-day
Every GCSE Computer Science sheet published in December 2002, with answers. Systems, data representation, networks, algorithms and programming.
Every sheet in December 2002
The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.
- 1st December 2002State the two values a Boolean data type can hold.
- 2nd December 2002Convert the denary number 200 to hexadecimal, showing your working.
- 3rd December 2002Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
- 4th December 2002State why a program written in a high level language must be translated.
- 5th December 2002Convert the hexadecimal number 1A to denary.
- 6th December 2002Convert the denary number 156 to an 8 bit binary number.
- 7th December 2002Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
- 8th December 2002Describe what a nested loop does when it processes a 2D array.
- 9th December 2002An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
- 10th December 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.
- 11th December 2002Describe two negative consequences of throwing away old computer hardware instead of recycling it.
- 12th December 2002Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
- 13th December 2002State the pseudocode operator commonly used to join (concatenate) two strings, then show how it joins 'Rev' and 'ision' to produce 'Revision'.
- 14th December 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.
- 15th December 2002Give two reasons why network communication is divided into layers.
- 16th December 2002Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
- 17th December 2002Define the term 'primary key' as used in a database table.
- 18th December 2002Define the term 'interrupt' as used to describe a signal received by a CPU.
- 19th December 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.
- 20th December 2002Evaluate X = NOT A AND B when A = 0 and B = 1.
- 21st December 2002Convert the 8-bit binary number 10110100 directly to hexadecimal by splitting it into nibbles.
- 22nd December 2002Give one advantage of a star topology compared with a mesh topology.
- 23rd December 2002Explain why an interpreter is often preferred while a program is being written.
- 24th December 2002Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
- 25th December 2002State the three stages of the fetch-decode-execute cycle in the order they occur.
- 26th December 2002State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
- 27th December 2002A 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.
- 28th December 2002Define the term 'pixel'.
- 29th December 2002Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
- 30th December 2002Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
- 31st December 2002Evaluate the expression 23 DIV 4.