Daily Practice · GCSE Computer Science

February 1976 5-a-day

Every sheet in February 1976

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 1976Convert the hexadecimal number 1A to denary.
  2. 2nd February 1976Convert the denary number 156 to an 8 bit binary number.
  3. 3rd February 1976Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  4. 4th February 1976Trace 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).
  5. 5th February 1976An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  6. 6th February 1976A 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.
  7. 7th February 1976Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  8. 8th February 1976Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  9. 9th February 1976State the key difference between a procedure and a function.
  10. 10th February 1976A 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.
  11. 11th February 1976Explain the role of TCP when a large file is downloaded.
  12. 12th February 1976Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  13. 13th February 1976Give one advantage of a relational database over a flat-file database.
  14. 14th February 1976Define the term 'interrupt' as used to describe a signal received by a CPU.
  15. 15th February 1976An 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.
  16. 16th February 1976Evaluate X = NOT A AND B when A = 0 and B = 1.
  17. 17th February 1976Convert the hexadecimal number 3F to denary.
  18. 18th February 1976Give one advantage of a star topology compared with a mesh topology.
  19. 19th February 1976Give one advantage and one disadvantage of using a compiler.
  20. 20th February 1976Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  21. 21st February 1976State the three stages of the fetch-decode-execute cycle in the order they occur.
  22. 22nd February 1976State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  23. 23rd February 1976Write a loop in pseudocode that outputs every element of a 1D array named names of length 6.
  24. 24th February 1976Define the term 'pixel'.
  25. 25th February 1976Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  26. 26th February 1976Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  27. 27th February 1976Evaluate the expression 23 DIV 4.
  28. 28th February 1976A programmer wants any syntax error in their program to be reported before the program starts running at all. State whether a compiler or an interpreter behaves this way, and explain why.
  29. 29th February 1976A 1 TB hard disk drive costs 40 pounds. A 500 GB solid-state drive costs 60 pounds. Calculate the cost per gigabyte of each device, and state which is cheaper per GB. Use 1 TB = 1000 GB.