Daily Practice · GCSE Computer Science

November 2008 - GCSE Computer Science 5-a-day

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

Every sheet in November 2008

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

  1. 1st November 2008Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  2. 2nd November 2008A 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;
  3. 3rd November 2008Each 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.
  4. 4th November 2008Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  5. 5th November 2008State the two values a Boolean data type can hold.
  6. 6th November 2008Convert the 8-bit binary number 01011010 to denary.
  7. 7th November 2008Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  8. 8th November 2008Describe what syntax highlighting is and how it helps a programmer.
  9. 9th November 2008Convert the hexadecimal number 1A to denary.
  10. 10th November 2008Convert the denary number 156 to an 8 bit binary number.
  11. 11th November 2008Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  12. 12th November 2008Trace 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).
  13. 13th November 2008An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  14. 14th November 2008A 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.
  15. 15th November 2008Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  16. 16th November 2008Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  17. 17th November 2008Write 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.
  18. 18th November 2008A 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.
  19. 19th November 2008Explain the role of TCP when a large file is downloaded.
  20. 20th November 2008Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  21. 21st November 2008State what a foreign key is used for.
  22. 22nd November 2008Define the term 'interrupt' as used to describe a signal received by a CPU.
  23. 23rd November 2008An 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.
  24. 24th November 2008Evaluate X = NOT A AND B when A = 0 and B = 1.
  25. 25th November 2008A 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.
  26. 26th November 2008Give one advantage of a star topology compared with a mesh topology.
  27. 27th November 2008Give one advantage and one disadvantage of using a compiler.
  28. 28th November 2008Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  29. 29th November 2008State the three stages of the fetch-decode-execute cycle in the order they occur.
  30. 30th November 2008State one weakness of a simple shift cipher compared to modern encryption methods used on networks.