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

November 1967 5-a-day

← Today's GCSE Computer Science sheet

November 1967

30 sheets · 150 questions · GCSE

November 1967 compilationAll answers

Every sheet in November 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 November 1967Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
  2. 2nd November 1967A 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.
  3. 3rd November 1967Give one reason why RAM on its own is not enough, and a computer also needs secondary storage.
  4. 4th November 1967Define the term protocol.
  5. 5th November 1967A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.
  6. 6th November 1967A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  7. 7th November 1967State one function carried out by the operating system of a computer.
  8. 8th November 1967In computational thinking, what is meant by the term 'decomposition'?
  9. 9th November 1967Given A = 1 and B = 1, state the value of A AND B.
  10. 10th November 1967Convert the denary number 39 to an 8-bit binary number, showing your working.
  11. 11th November 1967Define a peer-to-peer network.
  12. 12th November 1967Explain the purpose of a breakpoint.
  13. 13th November 1967Convert the denary number 5 to a 4-bit binary number.
  14. 14th November 1967A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  15. 15th November 1967A 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.
  16. 16th November 1967Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  17. 17th November 1967A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
  18. 18th November 1967State the type of program that is typically stored in ROM.
  19. 19th November 1967State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
  20. 20th November 1967A FOR loop runs: total = 0, FOR i = 1 TO 4, total = total + i, NEXT i. State the value of total after the loop finishes.
  21. 21st November 1967Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  22. 22nd November 1967State the typical maximum capacity of a single-layer DVD.
  23. 23rd November 1967Name the four layers of the TCP/IP model in order from the one closest to the user.
  24. 24th November 1967State what is meant by a syntax error.
  25. 25th November 1967A 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.
  26. 26th November 1967What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  27. 27th November 1967Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  28. 28th November 1967Given P = 0 and Q = 1, state the value of P OR Q.
  29. 29th November 1967Convert the hexadecimal number FF to an 8-bit binary number.
  30. 30th November 1967A 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.