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

September 1967 5-a-day

← Today's GCSE Computer Science sheet

September 1967

30 sheets · 150 questions · GCSE

September 1967 compilationAll answers

Every sheet in September 1967

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

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