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