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

May 1964 5-a-day

← Today's GCSE Computer Science sheet

May 1964

31 sheets · 155 questions · GCSE

May 1964 compilationAll answers

Every sheet in May 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 May 1964Which CPU register holds the address of the next instruction to be fetched?
  2. 2nd May 1964Distinguish between the network security threats known as phishing and pharming.
  3. 3rd May 1964Describe what a nested loop does when it processes a 2D array.
  4. 4th May 1964A row of pixels is encoded using run-length encoding as: 3W 4B 3W. State the original row of pixels it represents.
  5. 5th May 1964A photo file is 3.5 MB in size. Calculate its size in kilobytes (KB). Use 1 MB = 1000 KB.
  6. 6th May 1964A streaming company records which shows each user watches and uses this to recommend similar shows. Explain one ethical concern this could raise, even if the company only uses the data to improve recommendations.
  7. 7th May 1964State the most appropriate data type for storing a person's shoe size if only whole sizes (e.g. 7, 8, 9) are allowed.
  8. 8th May 1964Write the pseudocode header and body for a function called isAdult that takes one integer parameter called age and returns True if age is 18 or over.
  9. 9th May 1964Give one example of an optical secondary storage device.
  10. 10th May 1964Give two reasons why network communication is divided into layers.
  11. 11th May 1964State the term used for realistic data that a program would be expected to handle during normal use.
  12. 12th May 1964State what a foreign key is used for.
  13. 13th May 1964State the difference between lossy and lossless compression.
  14. 14th May 1964State the condition that must be met before a binary search can be used on an array.
  15. 15th May 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.
  16. 16th May 1964A pseudocode algorithm is: count <- 0, x <- 10, WHILE x > 0, count <- count + 1, x <- x - 3, ENDWHILE, OUTPUT count. Complete a trace table for x and count, laid out as x | count, then state the value output.
  17. 17th May 1964Which piece of network hardware connects a LAN to another network such as the internet, directing data packets based on IP address?
  18. 18th May 1964Explain why an interpreter is often preferred while a program is being written.
  19. 19th May 1964Convert the denary number 45 to hexadecimal.
  20. 20th May 1964What does the acronym CPU stand for?
  21. 21st May 1964State what the term malware means.
  22. 22nd May 1964A 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.
  23. 23rd May 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).
  24. 24th May 1964Which of RAM and ROM is volatile, meaning its contents are lost when the power is removed?
  25. 25th May 1964Which piece of UK legislation controls how organisations must store and use people's personal data?
  26. 26th May 1964Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
  27. 27th May 1964State the value returned by LENGTH(word) if word stores the string 'Computer'.
  28. 28th May 1964Give one reason why RAM on its own is not enough, and a computer also needs secondary storage.
  29. 29th May 1964State the layer that IP operates in, and describe its job.
  30. 30th May 1964A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.
  31. 31st May 1964A table called books has fields bookId, title, authorId and copiesAvailable. Write an SQL statement that selects the title of every book with more than 2 copies available.