Daily Practice · GCSE Computer Science

March 1968 5-a-day

Every sheet in March 1968

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

  1. 1st March 1968In computational thinking, what is meant by the term 'decomposition'?
  2. 2nd March 1968Given A = 1 and B = 1, state the value of A AND B.
  3. 3rd March 1968State how many different values can be represented using 5 bits, and explain your reasoning.
  4. 4th March 1968Define a peer-to-peer network.
  5. 5th March 1968Name the translator used for assembly language and describe how it differs from a compiler.
  6. 6th March 1968Convert the denary number 5 to a 4-bit binary number.
  7. 7th March 1968A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  8. 8th March 1968A 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 March 1968Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
  10. 10th March 1968A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
  11. 11th March 1968State the type of program that is typically stored in ROM.
  12. 12th March 1968State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
  13. 13th March 1968A 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 March 1968State the key difference between a procedure and a function.
  15. 15th March 1968State the typical maximum capacity of a single-layer DVD.
  16. 16th March 1968Define the term protocol.
  17. 17th March 1968State what is meant by a syntax error.
  18. 18th March 1968Give one advantage of a relational database over a flat-file database.
  19. 19th March 1968What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  20. 20th March 1968Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  21. 21st March 1968Given P = 0 and Q = 1, state the value of P OR Q.
  22. 22nd March 1968Convert the hexadecimal number 3F to denary.
  23. 23rd March 1968A 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 March 1968Explain the purpose of a breakpoint.
  25. 25th March 1968Convert the 4-bit binary number 1101 to denary.
  26. 26th March 1968Two 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 March 1968State why an organisation might employ penetration testers to test its network.
  28. 28th March 1968Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  29. 29th March 1968State one example of a file format that commonly uses lossy compression.
  30. 30th March 1968State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  31. 31st March 1968State whether the source code of proprietary (closed source) software is normally available for the public to view.