Daily Practice · GCSE Computer Science

May 2011 - GCSE Computer Science 5-a-day

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

Every sheet in May 2011

The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.

  1. 1st May 2011Give two reasons why network communication is divided into layers.
  2. 2nd May 2011Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  3. 3rd May 2011A table called staff has fields staffId, name, department and salary, storing these records: staffId | name | department | salary, 1 | Ben | Sales | 24000, 2 | Chloe | IT | 31000, 3 | Dan | Sales | 27000. State which staffId(s) would be returned by: SELECT staffId FROM staff WHERE department = 'Sales' AND salary > 25000;
  4. 4th May 2011Each pair from the previous question is stored using 2 bytes. Calculate the compression ratio achieved, given the uncompressed row (1 byte per pixel) uses 8 bytes.
  5. 5th May 2011Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  6. 6th May 2011State the two values a Boolean data type can hold.
  7. 7th May 2011Convert the 8-bit binary number 01011010 to denary.
  8. 8th May 2011Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  9. 9th May 2011Explain why an interpreter is often preferred while a program is being written.
  10. 10th May 2011Convert the hexadecimal number 1A to denary.
  11. 11th May 2011Convert the denary number 156 to an 8 bit binary number.
  12. 12th May 2011Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  13. 13th May 2011A 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.
  14. 14th May 2011An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  15. 15th May 2011A 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.
  16. 16th May 2011Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  17. 17th May 2011Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  18. 18th May 2011Write the pseudocode header and body for a function called isAdult that takes one integer parameter called age and returns True if age is 18 or over.
  19. 19th May 2011A 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.
  20. 20th May 2011State the layer that IP operates in, and describe its job.
  21. 21st May 2011Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  22. 22nd May 2011State what a foreign key is used for.
  23. 23rd May 2011Define the term 'interrupt' as used to describe a signal received by a CPU.
  24. 24th May 2011An 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.
  25. 25th May 2011Evaluate X = NOT A AND B when A = 0 and B = 1.
  26. 26th May 2011A pseudocode algorithm is: count <- 0, x <- 10, WHILE x > 0, count <- count + 1, x <- x - 3, ENDWHILE, OUTPUT count. Complete a trace table for x and count, laid out as x | count, then state the value output.
  27. 27th May 2011Give one advantage of a star topology compared with a mesh topology.
  28. 28th May 2011Describe what syntax highlighting is and how it helps a programmer.
  29. 29th May 2011Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  30. 30th May 2011State the three stages of the fetch-decode-execute cycle in the order they occur.
  31. 31st May 2011State one weakness of a simple shift cipher compared to modern encryption methods used on networks.