Daily Practice · GCSE Computer Science

December 1971 5-a-day

Every sheet in December 1971

The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.

  1. 1st December 1971State how many different values can be represented using 5 bits, and explain your reasoning.
  2. 2nd December 1971Define a peer-to-peer network.
  3. 3rd December 1971A 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.
  4. 4th December 1971Convert the denary number 5 to a 4-bit binary number.
  5. 5th December 1971A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  6. 6th December 1971A 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.
  7. 7th December 1971An array named temps holds 12 values. State the index of the first item and the index of the last item.
  8. 8th December 1971A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
  9. 9th December 1971State the type of program that is typically stored in ROM.
  10. 10th December 1971State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
  11. 11th December 1971A FOR loop runs: total = 0, FOR i = 1 TO 4, total = total + i, NEXT i. State the value of total after the loop finishes.
  12. 12th December 1971State the key difference between a procedure and a function.
  13. 13th December 1971State the typical maximum capacity of a single-layer DVD.
  14. 14th December 1971State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  15. 15th December 1971State what is meant by a syntax error.
  16. 16th December 1971Give one advantage of a relational database over a flat-file database.
  17. 17th December 1971What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  18. 18th December 1971Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  19. 19th December 1971Given P = 0 and Q = 1, state the value of P OR Q.
  20. 20th December 1971Convert the hexadecimal number 3F to denary.
  21. 21st December 1971A 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.
  22. 22nd December 1971State why a program written in a high level language must be translated.
  23. 23rd December 1971Convert the 4-bit binary number 1101 to denary.
  24. 24th December 1971Two 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.
  25. 25th December 1971State why an organisation might employ penetration testers to test its network.
  26. 26th December 1971Describe what a nested loop does when it processes a 2D array.
  27. 27th December 1971State one example of a file format that commonly uses lossy compression.
  28. 28th December 1971State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  29. 29th December 1971State whether the source code of proprietary (closed source) software is normally available for the public to view.
  30. 30th December 1971Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  31. 31st December 1971A 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.