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

June 1981 5-a-day

← Today's GCSE Computer Science sheet

June 1981

30 sheets · 150 questions · GCSE

June 1981 compilationAll answers

Every sheet in June 1981

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 1981A 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.
  2. 2nd June 1981State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  3. 3rd June 1981Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  4. 4th June 1981State what a foreign key is used for.
  5. 5th June 1981Define the term 'interrupt' as used to describe a signal received by a CPU.
  6. 6th June 1981An 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.
  7. 7th June 1981Evaluate X = NOT A AND B when A = 0 and B = 1.
  8. 8th June 1981A 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.
  9. 9th June 1981Give one advantage of a star topology compared with a mesh topology.
  10. 10th June 1981State why a program written in a high level language must be translated.
  11. 11th June 1981Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  12. 12th June 1981State the three stages of the fetch-decode-execute cycle in the order they occur.
  13. 13th June 1981State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  14. 14th June 1981Describe what a nested loop does when it processes a 2D array.
  15. 15th June 1981Define the term 'pixel'.
  16. 16th June 1981Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  17. 17th June 1981Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  18. 18th June 1981Evaluate the expression 23 DIV 4.
  19. 19th June 1981State the value returned by LENGTH(word) if word stores the string 'Computer'.
  20. 20th June 1981A 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.
  21. 21st June 1981Give two reasons why network communication is divided into layers.
  22. 22nd June 1981A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  23. 23rd June 1981A 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.
  24. 24th June 1981A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  25. 25th June 1981An array contains [9, 2, 6], to be sorted using insertion sort. Show the state of the array after each new element has been inserted into its correct position.
  26. 26th June 1981Complete: NOT 0 = ?
  27. 27th June 1981State how many different values can be represented using 5 bits, and explain your reasoning.
  28. 28th June 1981State what LAN stands for.
  29. 29th June 1981Explain why an interpreter is often preferred while a program is being written.
  30. 30th June 1981An 8-bit register stores the value 01100000 (denary 96). State the resulting 8-bit binary value after a left shift by 1 place, and state whether an overflow occurs.