Daily Practice · GCSE Computer Science

February 1989 5-a-day

Every sheet in February 1989

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

  1. 1st February 1989State why a program written in a high level language must be translated.
  2. 2nd February 1989Convert the denary number 5 to a 4-bit binary number.
  3. 3rd February 1989A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  4. 4th February 1989A 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.
  5. 5th February 1989Describe what a nested loop does when it processes a 2D array.
  6. 6th February 1989A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
  7. 7th February 1989State the type of program that is typically stored in ROM.
  8. 8th February 1989State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
  9. 9th February 1989A FOR loop runs: total = 0, FOR i = 1 TO 4, total = total + i, NEXT i. State the value of total after the loop finishes.
  10. 10th February 1989Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  11. 11th February 1989State the typical maximum capacity of a single-layer DVD.
  12. 12th February 1989Give two reasons why network communication is divided into layers.
  13. 13th February 1989State what is meant by a syntax error.
  14. 14th February 1989A 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.
  15. 15th February 1989What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  16. 16th February 1989Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  17. 17th February 1989Given P = 0 and Q = 1, state the value of P OR Q.
  18. 18th February 1989Convert the hexadecimal number FF to an 8-bit binary number.
  19. 19th February 1989A 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.
  20. 20th February 1989Explain why an interpreter is often preferred while a program is being written.
  21. 21st February 1989Convert the 4-bit binary number 1101 to denary.
  22. 22nd February 1989Two 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.
  23. 23rd February 1989State why an organisation might employ penetration testers to test its network.
  24. 24th February 1989A 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.
  25. 25th February 1989State one example of a file format that commonly uses lossy compression.
  26. 26th February 1989State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  27. 27th February 1989State whether the source code of proprietary (closed source) software is normally available for the public to view.
  28. 28th February 1989Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.