Daily Practice · GCSE Computer Science

September 1964 5-a-day

Every sheet in September 1964

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 1964State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  2. 2nd September 1964State the term used for realistic data that a program would be expected to handle during normal use.
  3. 3rd September 1964Define the term 'primary key' as used in a database table.
  4. 4th September 1964State the difference between lossy and lossless compression.
  5. 5th September 1964State the condition that must be met before a binary search can be used on an array.
  6. 6th September 1964A logic circuit has inputs C and D. C feeds into a NOT gate; the output of the NOT gate and D feed into an OR gate, giving output Y. Write the Boolean expression for Y and state its value when C = 1 and D = 0.
  7. 7th September 1964Convert the 8-bit binary number 10110100 directly to hexadecimal by splitting it into nibbles.
  8. 8th September 1964Which piece of network hardware connects a LAN to another network such as the internet, directing data packets based on IP address?
  9. 9th September 1964State why a program written in a high level language must be translated.
  10. 10th September 1964Convert the denary number 45 to hexadecimal.
  11. 11th September 1964What does the acronym CPU stand for?
  12. 12th September 1964State what the term malware means.
  13. 13th September 1964Describe what a nested loop does when it processes a 2D array.
  14. 14th September 1964An uncompressed file is 6000 KB. After lossless compression it is 1500 KB. Calculate the compression ratio in the form n:1 (original size : compressed size).
  15. 15th September 1964Which of RAM and ROM is volatile, meaning its contents are lost when the power is removed?
  16. 16th September 1964Which piece of UK legislation controls how organisations must store and use people's personal data?
  17. 17th September 1964Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
  18. 18th September 1964A function is defined as: FUNCTION addTax(price) RETURN price x 1.2 ENDFUNCTION. Another line of code runs: total <- addTax(20) + addTax(30). Trace both function calls and state the final value of total.
  19. 19th September 1964Give one reason why RAM on its own is not enough, and a computer also needs secondary storage.
  20. 20th September 1964Give two reasons why network communication is divided into layers.
  21. 21st September 1964A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.
  22. 22nd September 1964A table called staff has fields staffId, name, department and salary, storing these records: staffId | name | department | salary, 1 | Ben | Sales | 24000, 2 | Chloe | IT | 31000, 3 | Dan | Sales | 27000. State which staffId(s) would be returned by: SELECT staffId FROM staff WHERE department = 'Sales' AND salary > 25000;
  23. 23rd September 1964State one function carried out by the operating system of a computer.
  24. 24th September 1964In computational thinking, what is meant by the term 'decomposition'?
  25. 25th September 1964Given A = 1 and B = 1, state the value of A AND B.
  26. 26th September 1964Convert the 8-bit binary number 01011010 to denary.
  27. 27th September 1964Define a peer-to-peer network.
  28. 28th September 1964Explain why an interpreter is often preferred while a program is being written.
  29. 29th September 1964Convert the denary number 5 to a 4-bit binary number.
  30. 30th September 1964A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.