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

February 1966 5-a-day

← Today's GCSE Computer Science sheet

February 1966

28 sheets · 140 questions · GCSE

February 1966 compilationAll answers

Every sheet in February 1966

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