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

November 1982 5-a-day

← Today's GCSE Computer Science sheet

November 1982

30 sheets · 150 questions · GCSE

November 1982 compilationAll answers

Every sheet in November 1982

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 1982In computational thinking, what is meant by the term 'decomposition'?
  2. 2nd November 1982Given A = 1 and B = 1, state the value of A AND B.
  3. 3rd November 1982Convert the denary number 39 to an 8-bit binary number, showing your working.
  4. 4th November 1982Define a peer-to-peer network.
  5. 5th November 1982A program compiles and runs but always outputs an average that is too small. State the type of error and explain why the translator did not report it.
  6. 6th November 1982Convert the denary number 5 to a 4-bit binary number.
  7. 7th November 1982A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  8. 8th November 1982A 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.
  9. 9th November 1982An array named temps holds 12 values. State the index of the first item and the index of the last item.
  10. 10th November 1982A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
  11. 11th November 1982State the type of program that is typically stored in ROM.
  12. 12th November 1982State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
  13. 13th November 1982A FOR loop runs: total = 0, FOR i = 1 TO 4, total = total + i, NEXT i. State the value of total after the loop finishes.
  14. 14th November 1982Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  15. 15th November 1982State the typical maximum capacity of a single-layer DVD.
  16. 16th November 1982State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  17. 17th November 1982State what is meant by a syntax error.
  18. 18th November 1982A 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.
  19. 19th November 1982What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  20. 20th November 1982Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  21. 21st November 1982Given P = 0 and Q = 1, state the value of P OR Q.
  22. 22nd November 1982Convert the hexadecimal number FF to an 8-bit binary number.
  23. 23rd November 1982A 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.
  24. 24th November 1982State why a program written in a high level language must be translated.
  25. 25th November 1982Convert the 4-bit binary number 1101 to denary.
  26. 26th November 1982Two 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.
  27. 27th November 1982State why an organisation might employ penetration testers to test its network.
  28. 28th November 1982Describe what a nested loop does when it processes a 2D array.
  29. 29th November 1982State one example of a file format that commonly uses lossy compression.
  30. 30th November 1982State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).