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