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

January 1969 5-a-day

← Today's GCSE Computer Science sheet

January 1969

31 sheets · 155 questions · GCSE

January 1969 compilationAll answers

Every sheet in January 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 January 1969State how many different values can be represented using 5 bits, and explain your reasoning.
  2. 2nd January 1969State what LAN stands for.
  3. 3rd January 1969A program compiles and runs but always outputs an average that is too small. State the type of error and explain why the translator did not report it.
  4. 4th January 1969An 8-bit register stores the value 01100000 (denary 96). State the resulting 8-bit binary value after a left shift by 1 place, and state whether an overflow occurs.
  5. 5th January 1969Which CPU register holds the address of the next instruction to be fetched?
  6. 6th January 1969Distinguish between the network security threats known as phishing and pharming.
  7. 7th January 1969An array named temps holds 12 values. State the index of the first item and the index of the last item.
  8. 8th January 1969A row of pixels is encoded using run-length encoding as: 3W 4B 3W. State the original row of pixels it represents.
  9. 9th January 1969A photo file is 3.5 MB in size. Calculate its size in kilobytes (KB). Use 1 MB = 1000 KB.
  10. 10th January 1969A 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.
  11. 11th January 1969State the most appropriate data type for storing a person's shoe size if only whole sizes (e.g. 7, 8, 9) are allowed.
  12. 12th January 1969State the key difference between a procedure and a function.
  13. 13th January 1969Give one example of an optical secondary storage device.
  14. 14th January 1969State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  15. 15th January 1969State the term used for realistic data that a program would be expected to handle during normal use.
  16. 16th January 1969Give one advantage of a relational database over a flat-file database.
  17. 17th January 1969State the difference between lossy and lossless compression.
  18. 18th January 1969State the condition that must be met before a binary search can be used on an array.
  19. 19th January 1969A 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.
  20. 20th January 1969Convert the hexadecimal number 3F to denary.
  21. 21st January 1969Which piece of network hardware connects a LAN to another network such as the internet, directing data packets based on IP address?
  22. 22nd January 1969State why a program written in a high level language must be translated.
  23. 23rd January 1969Convert the denary number 45 to hexadecimal.
  24. 24th January 1969What does the acronym CPU stand for?
  25. 25th January 1969State what the term malware means.
  26. 26th January 1969Describe what a nested loop does when it processes a 2D array.
  27. 27th January 1969An 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).
  28. 28th January 1969Which of RAM and ROM is volatile, meaning its contents are lost when the power is removed?
  29. 29th January 1969Which piece of UK legislation controls how organisations must store and use people's personal data?
  30. 30th January 1969Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
  31. 31st January 1969A programmer wants any syntax error in their program to be reported before the program starts running at all. State whether a compiler or an interpreter behaves this way, and explain why.