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

June 1976 5-a-day

← Today's GCSE Computer Science sheet

June 1976

30 sheets · 150 questions · GCSE

June 1976 compilationAll answers

Every sheet in June 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 June 1976Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  2. 2nd June 1976Write 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.
  3. 3rd June 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.
  4. 4th June 1976State the layer that IP operates in, and describe its job.
  5. 5th June 1976Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  6. 6th June 1976State what a foreign key is used for.
  7. 7th June 1976Define the term 'interrupt' as used to describe a signal received by a CPU.
  8. 8th June 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.
  9. 9th June 1976Evaluate X = NOT A AND B when A = 0 and B = 1.
  10. 10th June 1976A 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.
  11. 11th June 1976Give one advantage of a star topology compared with a mesh topology.
  12. 12th June 1976Describe what syntax highlighting is and how it helps a programmer.
  13. 13th June 1976Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  14. 14th June 1976State the three stages of the fetch-decode-execute cycle in the order they occur.
  15. 15th June 1976State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  16. 16th June 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).
  17. 17th June 1976Define the term 'pixel'.
  18. 18th June 1976Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  19. 19th June 1976Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  20. 20th June 1976Evaluate the expression 23 DIV 4.
  21. 21st June 1976State the value returned by LENGTH(word) if word stores the string 'Computer'.
  22. 22nd June 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.
  23. 23rd June 1976Explain the role of TCP when a large file is downloaded.
  24. 24th June 1976A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  25. 25th June 1976A 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.
  26. 26th June 1976A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  27. 27th June 1976An 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.
  28. 28th June 1976Complete: NOT 0 = ?
  29. 29th June 1976State how many different values can be represented using 5 bits, and explain your reasoning.
  30. 30th June 1976State what LAN stands for.