Revision Library
/Subjects/Computer Science/Daily Practice
Daily Practice · GCSE Computer Science

February 1961 5-a-day

← Today's GCSE Computer Science sheet

February 1961

28 sheets · 140 questions · GCSE

February 1961 compilationAll answers

Every sheet in February 1961

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

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