Daily Practice · GCSE Computer Science

March 1960 5-a-day

Every sheet in March 1960

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

  1. 1st March 1960Name the translator used for assembly language and describe how it differs from a compiler.
  2. 2nd March 1960Convert the hexadecimal number 1A to denary.
  3. 3rd March 1960Convert the denary number 156 to an 8 bit binary number.
  4. 4th March 1960Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  5. 5th March 1960Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
  6. 6th March 1960An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  7. 7th March 1960A 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.
  8. 8th March 1960Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  9. 9th March 1960Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  10. 10th March 1960Write the pseudocode header and body for a function called isAdult that takes one integer parameter called age and returns True if age is 18 or over.
  11. 11th March 1960A 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.
  12. 12th March 1960Define the term protocol.
  13. 13th March 1960Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  14. 14th March 1960State what a foreign key is used for.
  15. 15th March 1960Define the term 'interrupt' as used to describe a signal received by a CPU.
  16. 16th March 1960An 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.
  17. 17th March 1960Evaluate X = NOT A AND B when A = 0 and B = 1.
  18. 18th March 1960A pseudocode algorithm is: count <- 0, x <- 10, WHILE x > 0, count <- count + 1, x <- x - 3, ENDWHILE, OUTPUT count. Complete a trace table for x and count, laid out as x | count, then state the value output.
  19. 19th March 1960Give one advantage of a star topology compared with a mesh topology.
  20. 20th March 1960Explain the purpose of a breakpoint.
  21. 21st March 1960Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  22. 22nd March 1960State the three stages of the fetch-decode-execute cycle in the order they occur.
  23. 23rd March 1960State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  24. 24th March 1960Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  25. 25th March 1960Define the term 'pixel'.
  26. 26th March 1960Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  27. 27th March 1960Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  28. 28th March 1960Evaluate the expression 23 DIV 4.
  29. 29th March 1960State the value returned by LENGTH(word) if word stores the string 'Computer'.
  30. 30th March 1960A 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.
  31. 31st March 1960Name the four layers of the TCP/IP model in order from the one closest to the user.