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

June 1969 5-a-day

← Today's GCSE Computer Science sheet

June 1969

30 sheets · 150 questions · GCSE

June 1969 compilationAll answers

Every sheet in June 1969

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

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