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

November 1977 5-a-day

← Today's GCSE Computer Science sheet

November 1977

30 sheets · 150 questions · GCSE

November 1977 compilationAll answers

Every sheet in November 1977

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 1977A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  2. 2nd November 1977State one function carried out by the operating system of a computer.
  3. 3rd November 1977In computational thinking, what is meant by the term 'decomposition'?
  4. 4th November 1977Given A = 1 and B = 1, state the value of A AND B.
  5. 5th November 1977Convert the denary number 39 to an 8-bit binary number, showing your working.
  6. 6th November 1977Define a peer-to-peer network.
  7. 7th November 1977Explain why an interpreter is often preferred while a program is being written.
  8. 8th November 1977Convert the denary number 5 to a 4-bit binary number.
  9. 9th November 1977A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  10. 10th November 1977A 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.
  11. 11th November 1977A 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.
  12. 12th November 1977A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
  13. 13th November 1977State the type of program that is typically stored in ROM.
  14. 14th November 1977State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
  15. 15th November 1977A FOR loop runs: total = 0, FOR i = 1 TO 4, total = total + i, NEXT i. State the value of total after the loop finishes.
  16. 16th November 1977Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  17. 17th November 1977State the typical maximum capacity of a single-layer DVD.
  18. 18th November 1977State the layer that IP operates in, and describe its job.
  19. 19th November 1977State what is meant by a syntax error.
  20. 20th November 1977A 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.
  21. 21st November 1977What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  22. 22nd November 1977Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  23. 23rd November 1977Given P = 0 and Q = 1, state the value of P OR Q.
  24. 24th November 1977Convert the hexadecimal number FF to an 8-bit binary number.
  25. 25th November 1977A 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.
  26. 26th November 1977Describe what syntax highlighting is and how it helps a programmer.
  27. 27th November 1977Convert the 4-bit binary number 1101 to denary.
  28. 28th November 1977Two CPUs are compared for a task optimised for multiple cores: CPU A has 2 cores at 4.2 GHz; CPU B has 6 cores at 3.0 GHz. Explain which CPU is likely to perform better for this task.
  29. 29th November 1977State why an organisation might employ penetration testers to test its network.
  30. 30th November 1977Trace 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).