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

March 1966 5-a-day

← Today's GCSE Computer Science sheet

March 1966

31 sheets · 155 questions · GCSE

March 1966 compilationAll answers

Every sheet in March 1966

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

  1. 1st March 1966Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  2. 2nd March 1966Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  3. 3rd March 1966Evaluate the expression 23 DIV 4.
  4. 4th March 1966A 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.
  5. 5th March 1966A 1 TB hard disk drive costs 40 pounds. A 500 GB solid-state drive costs 60 pounds. Calculate the cost per gigabyte of each device, and state which is cheaper per GB. Use 1 TB = 1000 GB.
  6. 6th March 1966Give two reasons why network communication is divided into layers.
  7. 7th March 1966A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  8. 8th March 1966A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  9. 9th March 1966A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  10. 10th March 1966An array contains [9, 2, 6], to be sorted using insertion sort. Show the state of the array after each new element has been inserted into its correct position.
  11. 11th March 1966Complete: NOT 0 = ?
  12. 12th March 1966Convert the denary number 39 to an 8-bit binary number, showing your working.
  13. 13th March 1966State what LAN stands for.
  14. 14th March 1966Explain why an interpreter is often preferred while a program is being written.
  15. 15th March 1966An 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.
  16. 16th March 1966Which CPU register holds the address of the next instruction to be fetched?
  17. 17th March 1966Distinguish between the network security threats known as phishing and pharming.
  18. 18th March 1966A 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.
  19. 19th March 1966A row of pixels is encoded using run-length encoding as: 3W 4B 3W. State the original row of pixels it represents.
  20. 20th March 1966A photo file is 3.5 MB in size. Calculate its size in kilobytes (KB). Use 1 MB = 1000 KB.
  21. 21st March 1966A 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.
  22. 22nd March 1966State the most appropriate data type for storing a person's shoe size if only whole sizes (e.g. 7, 8, 9) are allowed.
  23. 23rd March 1966Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  24. 24th March 1966Give one example of an optical secondary storage device.
  25. 25th March 1966State the layer that IP operates in, and describe its job.
  26. 26th March 1966State the term used for realistic data that a program would be expected to handle during normal use.
  27. 27th March 1966A table called members has fields memberId, firstName, lastName and joinYear. Write an SQL statement that adds a new record with memberId 12, firstName 'Priya', lastName 'Shah' and joinYear 2026.
  28. 28th March 1966State the difference between lossy and lossless compression.
  29. 29th March 1966State the condition that must be met before a binary search can be used on an array.
  30. 30th March 1966A 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.
  31. 31st March 1966Convert the hexadecimal number FF to an 8-bit binary number.