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

August 1968 5-a-day

← Today's GCSE Computer Science sheet

August 1968

31 sheets · 155 questions · GCSE

August 1968 compilationAll answers

Every sheet in August 1968

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

  1. 1st August 1968State the two values a Boolean data type can hold.
  2. 2nd August 1968State how many different values can be represented using 5 bits, and explain your reasoning.
  3. 3rd August 1968Calculate 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 August 1968Explain the purpose of a breakpoint.
  5. 5th August 1968Convert the hexadecimal number 1A to denary.
  6. 6th August 1968Convert the denary number 156 to an 8 bit binary number.
  7. 7th August 1968Which 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 August 1968Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  9. 9th August 1968An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  10. 10th August 1968A 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 August 1968Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  12. 12th August 1968Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  13. 13th August 1968State the key difference between a procedure and a function.
  14. 14th August 1968A 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 August 1968Name the four layers of the TCP/IP model in order from the one closest to the user.
  16. 16th August 1968Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  17. 17th August 1968Give one advantage of a relational database over a flat-file database.
  18. 18th August 1968Define the term 'interrupt' as used to describe a signal received by a CPU.
  19. 19th August 1968An 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 August 1968Evaluate X = NOT A AND B when A = 0 and B = 1.
  21. 21st August 1968Convert the hexadecimal number 3F to denary.
  22. 22nd August 1968Give one advantage of a star topology compared with a mesh topology.
  23. 23rd August 1968A 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.
  24. 24th August 1968Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  25. 25th August 1968State the three stages of the fetch-decode-execute cycle in the order they occur.
  26. 26th August 1968State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  27. 27th August 1968An array named temps holds 12 values. State the index of the first item and the index of the last item.
  28. 28th August 1968Define the term 'pixel'.
  29. 29th August 1968Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  30. 30th August 1968Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  31. 31st August 1968Evaluate the expression 23 DIV 4.