Daily Practice · GCSE Computer Science

August 1966 5-a-day

Every sheet in August 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 August 1966Which piece of UK legislation controls how organisations must store and use people's personal data?
  2. 2nd August 1966Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
  3. 3rd August 1966A 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.
  4. 4th August 1966Give one reason why RAM on its own is not enough, and a computer also needs secondary storage.
  5. 5th August 1966State the layer that IP operates in, and describe its job.
  6. 6th August 1966A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.
  7. 7th August 1966A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  8. 8th August 1966State one function carried out by the operating system of a computer.
  9. 9th August 1966In computational thinking, what is meant by the term 'decomposition'?
  10. 10th August 1966Given A = 1 and B = 1, state the value of A AND B.
  11. 11th August 1966Convert the denary number 39 to an 8-bit binary number, showing your working.
  12. 12th August 1966Define a peer-to-peer network.
  13. 13th August 1966Describe what syntax highlighting is and how it helps a programmer.
  14. 14th August 1966Convert the denary number 5 to a 4-bit binary number.
  15. 15th August 1966A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  16. 16th August 1966A simple cipher shifts every letter 2 places forward in the alphabet, wrapping around so Y becomes A and Z becomes B. Encrypt the plaintext CAT using this cipher.
  17. 17th August 1966Trace 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).
  18. 18th August 1966A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
  19. 19th August 1966State the type of program that is typically stored in ROM.
  20. 20th August 1966State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
  21. 21st August 1966A FOR loop runs: total = 0, FOR i = 1 TO 4, total = total + i, NEXT i. State the value of total after the loop finishes.
  22. 22nd August 1966Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  23. 23rd August 1966State the typical maximum capacity of a single-layer DVD.
  24. 24th August 1966Explain the role of TCP when a large file is downloaded.
  25. 25th August 1966State what is meant by a syntax error.
  26. 26th August 1966A 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.
  27. 27th August 1966What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  28. 28th August 1966Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  29. 29th August 1966Given P = 0 and Q = 1, state the value of P OR Q.
  30. 30th August 1966Convert the hexadecimal number FF to an 8-bit binary number.
  31. 31st August 1966A network administrator is connecting 10 computers in a server room. Calculate the number of cables needed for a full mesh topology, and state the number needed for a star topology with one central switch.