Daily Practice · GCSE Computer Science

June 1966 5-a-day

Every sheet in June 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 June 1966Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  2. 2nd June 1966Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  3. 3rd June 1966An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  4. 4th June 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.
  5. 5th June 1966Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  6. 6th June 1966Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  7. 7th June 1966Write 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.
  8. 8th June 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.
  9. 9th June 1966Name the four layers of the TCP/IP model in order from the one closest to the user.
  10. 10th June 1966Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  11. 11th June 1966State what a foreign key is used for.
  12. 12th June 1966Define the term 'interrupt' as used to describe a signal received by a CPU.
  13. 13th June 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.
  14. 14th June 1966Evaluate X = NOT A AND B when A = 0 and B = 1.
  15. 15th June 1966A 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.
  16. 16th June 1966Give one advantage of a star topology compared with a mesh topology.
  17. 17th June 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.
  18. 18th June 1966Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  19. 19th June 1966State the three stages of the fetch-decode-execute cycle in the order they occur.
  20. 20th June 1966State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  21. 21st June 1966An array named temps holds 12 values. State the index of the first item and the index of the last item.
  22. 22nd June 1966Define the term 'pixel'.
  23. 23rd June 1966Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  24. 24th June 1966Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  25. 25th June 1966Evaluate the expression 23 DIV 4.
  26. 26th June 1966State the value returned by LENGTH(word) if word stores the string 'Computer'.
  27. 27th June 1966A 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.
  28. 28th June 1966State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  29. 29th June 1966A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  30. 30th June 1966A table called books has fields bookId, title, authorId and copiesAvailable. Write an SQL statement that selects the title of every book with more than 2 copies available.