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

December 1966 5-a-day

← Today's GCSE Computer Science sheet

December 1966

31 sheets · 155 questions · GCSE

December 1966 compilationAll answers

Every sheet in December 1966

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 1966In computational thinking, what is meant by the term 'decomposition'?
  2. 2nd December 1966Given A = 1 and B = 1, state the value of A AND B.
  3. 3rd December 1966State how many different values can be represented using 5 bits, and explain your reasoning.
  4. 4th December 1966Define a peer-to-peer network.
  5. 5th December 1966Explain why an interpreter is often preferred while a program is being written.
  6. 6th December 1966Convert the denary number 5 to a 4-bit binary number.
  7. 7th December 1966A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  8. 8th December 1966A 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 December 1966A 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.
  10. 10th December 1966A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
  11. 11th December 1966State the type of program that is typically stored in ROM.
  12. 12th December 1966State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
  13. 13th December 1966A 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 December 1966State the key difference between a procedure and a function.
  15. 15th December 1966State the typical maximum capacity of a single-layer DVD.
  16. 16th December 1966State the layer that IP operates in, and describe its job.
  17. 17th December 1966State what is meant by a syntax error.
  18. 18th December 1966Give one advantage of a relational database over a flat-file database.
  19. 19th December 1966What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  20. 20th December 1966Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  21. 21st December 1966Given P = 0 and Q = 1, state the value of P OR Q.
  22. 22nd December 1966Convert the hexadecimal number 3F to denary.
  23. 23rd December 1966A 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 December 1966Describe what syntax highlighting is and how it helps a programmer.
  25. 25th December 1966Convert the 4-bit binary number 1101 to denary.
  26. 26th December 1966Two 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 December 1966State why an organisation might employ penetration testers to test its network.
  28. 28th December 1966Trace this algorithm with data = [4, 9, 2, 9, 7] and state the final output. total = 0; count = 0; for i = 0 to 4: if data[i] > 5 then total = total + data[i] and count = count + 1; next i; print(total, count).
  29. 29th December 1966State one example of a file format that commonly uses lossy compression.
  30. 30th December 1966State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  31. 31st December 1966State whether the source code of proprietary (closed source) software is normally available for the public to view.