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

September 1965 5-a-day

← Today's GCSE Computer Science sheet

September 1965

30 sheets · 150 questions · GCSE

September 1965 compilationAll answers

Every sheet in September 1965

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

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