Daily Practice · GCSE Computer Science

November 1959 5-a-day

Every sheet in November 1959

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 1959Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  2. 2nd November 1959A table called books has fields bookId, title, authorId and copiesAvailable. Write an SQL statement that selects the title of every book with more than 2 copies available.
  3. 3rd November 1959Each 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 1959Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  5. 5th November 1959State the two values a Boolean data type can hold.
  6. 6th November 1959State how many different values can be represented using 5 bits, and explain your reasoning.
  7. 7th November 1959Calculate 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 1959Explain the purpose of a breakpoint.
  9. 9th November 1959Convert the hexadecimal number 1A to denary.
  10. 10th November 1959Convert the denary number 156 to an 8 bit binary number.
  11. 11th November 1959Which 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 1959Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  13. 13th November 1959An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  14. 14th November 1959A 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 1959Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  16. 16th November 1959Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  17. 17th November 1959State the key difference between a procedure and a function.
  18. 18th November 1959A 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 1959Name the four layers of the TCP/IP model in order from the one closest to the user.
  20. 20th November 1959Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  21. 21st November 1959Give one advantage of a relational database over a flat-file database.
  22. 22nd November 1959Define the term 'interrupt' as used to describe a signal received by a CPU.
  23. 23rd November 1959An 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 1959Evaluate X = NOT A AND B when A = 0 and B = 1.
  25. 25th November 1959Convert the hexadecimal number 3F to denary.
  26. 26th November 1959Give one advantage of a star topology compared with a mesh topology.
  27. 27th November 1959A program compiles and runs but always outputs an average that is too small. State the type of error and explain why the translator did not report it.
  28. 28th November 1959Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  29. 29th November 1959State the three stages of the fetch-decode-execute cycle in the order they occur.
  30. 30th November 1959State one weakness of a simple shift cipher compared to modern encryption methods used on networks.