Daily Practice · GCSE Computer Science

September 1963 5-a-day

Every sheet in September 1963

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 1963Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  2. 2nd September 1963Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  3. 3rd September 1963Evaluate the expression 23 DIV 4.
  4. 4th September 1963A programmer wants any syntax error in their program to be reported before the program starts running at all. State whether a compiler or an interpreter behaves this way, and explain why.
  5. 5th September 1963A 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.
  6. 6th September 1963State the layer that IP operates in, and describe its job.
  7. 7th September 1963A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  8. 8th September 1963A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  9. 9th September 1963A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  10. 10th September 1963An 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.
  11. 11th September 1963Complete: NOT 0 = ?
  12. 12th September 1963Convert the denary number 39 to an 8-bit binary number, showing your working.
  13. 13th September 1963State what LAN stands for.
  14. 14th September 1963Describe what syntax highlighting is and how it helps a programmer.
  15. 15th September 1963An 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.
  16. 16th September 1963Which CPU register holds the address of the next instruction to be fetched?
  17. 17th September 1963Distinguish between the network security threats known as phishing and pharming.
  18. 18th September 1963Trace 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).
  19. 19th September 1963A row of pixels is encoded using run-length encoding as: 3W 4B 3W. State the original row of pixels it represents.
  20. 20th September 1963A photo file is 3.5 MB in size. Calculate its size in kilobytes (KB). Use 1 MB = 1000 KB.
  21. 21st September 1963A streaming company records which shows each user watches and uses this to recommend similar shows. Explain one ethical concern this could raise, even if the company only uses the data to improve recommendations.
  22. 22nd September 1963State the most appropriate data type for storing a person's shoe size if only whole sizes (e.g. 7, 8, 9) are allowed.
  23. 23rd September 1963Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  24. 24th September 1963Give one example of an optical secondary storage device.
  25. 25th September 1963Explain the role of TCP when a large file is downloaded.
  26. 26th September 1963State the term used for realistic data that a program would be expected to handle during normal use.
  27. 27th September 1963A table called members has fields memberId, firstName, lastName and joinYear. Write an SQL statement that adds a new record with memberId 12, firstName 'Priya', lastName 'Shah' and joinYear 2026.
  28. 28th September 1963State the difference between lossy and lossless compression.
  29. 29th September 1963State the condition that must be met before a binary search can be used on an array.
  30. 30th September 1963A logic circuit has inputs C and D. C feeds into a NOT gate; the output of the NOT gate and D feed into an OR gate, giving output Y. Write the Boolean expression for Y and state its value when C = 1 and D = 0.