Daily Practice · GCSE Computer Science

June 1968 5-a-day

Every sheet in June 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 June 1968State the term used for realistic data that a program would be expected to handle during normal use.
  2. 2nd June 1968Define the term 'primary key' as used in a database table.
  3. 3rd June 1968State the difference between lossy and lossless compression.
  4. 4th June 1968State the condition that must be met before a binary search can be used on an array.
  5. 5th June 1968A 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.
  6. 6th June 1968Convert the 8-bit binary number 10110100 directly to hexadecimal by splitting it into nibbles.
  7. 7th June 1968Which piece of network hardware connects a LAN to another network such as the internet, directing data packets based on IP address?
  8. 8th June 1968Describe what syntax highlighting is and how it helps a programmer.
  9. 9th June 1968Convert the denary number 45 to hexadecimal.
  10. 10th June 1968What does the acronym CPU stand for?
  11. 11th June 1968State what the term malware means.
  12. 12th June 1968Trace 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).
  13. 13th June 1968An 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).
  14. 14th June 1968Which of RAM and ROM is volatile, meaning its contents are lost when the power is removed?
  15. 15th June 1968Which piece of UK legislation controls how organisations must store and use people's personal data?
  16. 16th June 1968Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
  17. 17th June 1968A 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.
  18. 18th June 1968Give one reason why RAM on its own is not enough, and a computer also needs secondary storage.
  19. 19th June 1968Explain the role of TCP when a large file is downloaded.
  20. 20th June 1968A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.
  21. 21st June 1968A 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;
  22. 22nd June 1968State one function carried out by the operating system of a computer.
  23. 23rd June 1968In computational thinking, what is meant by the term 'decomposition'?
  24. 24th June 1968Given A = 1 and B = 1, state the value of A AND B.
  25. 25th June 1968Convert the 8-bit binary number 01011010 to denary.
  26. 26th June 1968Define a peer-to-peer network.
  27. 27th June 1968Give one advantage and one disadvantage of using a compiler.
  28. 28th June 1968Convert the denary number 5 to a 4-bit binary number.
  29. 29th June 1968A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  30. 30th June 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.