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

June 1962 5-a-day

← Today's GCSE Computer Science sheet

June 1962

30 sheets · 150 questions · GCSE

June 1962 compilationAll answers

Every sheet in June 1962

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 1962Define the term 'pixel'.
  2. 2nd June 1962Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  3. 3rd June 1962Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  4. 4th June 1962Evaluate the expression 23 DIV 4.
  5. 5th June 1962A 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.
  6. 6th June 1962A 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.
  7. 7th June 1962Name the four layers of the TCP/IP model in order from the one closest to the user.
  8. 8th June 1962A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  9. 9th June 1962A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  10. 10th June 1962A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  11. 11th June 1962An 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.
  12. 12th June 1962Complete: NOT 0 = ?
  13. 13th June 1962Convert the denary number 39 to an 8-bit binary number, showing your working.
  14. 14th June 1962State what LAN stands for.
  15. 15th June 1962A 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.
  16. 16th June 1962An 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.
  17. 17th June 1962Which CPU register holds the address of the next instruction to be fetched?
  18. 18th June 1962Distinguish between the network security threats known as phishing and pharming.
  19. 19th June 1962An array named temps holds 12 values. State the index of the first item and the index of the last item.
  20. 20th June 1962A row of pixels is encoded using run-length encoding as: 3W 4B 3W. State the original row of pixels it represents.
  21. 21st June 1962A photo file is 3.5 MB in size. Calculate its size in kilobytes (KB). Use 1 MB = 1000 KB.
  22. 22nd June 1962A 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.
  23. 23rd June 1962State the most appropriate data type for storing a person's shoe size if only whole sizes (e.g. 7, 8, 9) are allowed.
  24. 24th June 1962Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  25. 25th June 1962Give one example of an optical secondary storage device.
  26. 26th June 1962State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  27. 27th June 1962State the term used for realistic data that a program would be expected to handle during normal use.
  28. 28th June 1962A 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.
  29. 29th June 1962State the difference between lossy and lossless compression.
  30. 30th June 1962State the condition that must be met before a binary search can be used on an array.