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

May 1983 5-a-day

← Today's GCSE Computer Science sheet

May 1983

31 sheets · 155 questions · GCSE

May 1983 compilationAll answers

Every sheet in May 1983

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 1983Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  2. 2nd May 1983Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  3. 3rd May 1983Evaluate the expression 23 DIV 4.
  4. 4th May 1983State the correct order of the three operations used to read data from a text file.
  5. 5th May 1983A 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 May 1983State the layer that IP operates in, and describe its job.
  7. 7th May 1983A '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 May 1983A table called products has fields productId, name, price and stock. Write an SQL statement that changes the price of the product with productId 7 to 15.99.
  9. 9th May 1983A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  10. 10th May 1983An 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 May 1983Complete: NOT 0 = ?
  12. 12th May 1983Convert the denary number 200 to hexadecimal, showing your working.
  13. 13th May 1983State what LAN stands for.
  14. 14th May 1983Describe what syntax highlighting is and how it helps a programmer.
  15. 15th May 1983An 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 May 1983Which CPU register holds the address of the next instruction to be fetched?
  17. 17th May 1983Distinguish between the network security threats known as phishing and pharming.
  18. 18th May 1983Trace 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).
  19. 19th May 1983A row of pixels is encoded using run-length encoding as: 3W 4B 3W. State the original row of pixels it represents.
  20. 20th May 1983A photo file is 3.5 MB in size. Calculate its size in kilobytes (KB). Use 1 MB = 1000 KB.
  21. 21st May 1983A 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 May 1983State 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 May 1983State the pseudocode operator commonly used to join (concatenate) two strings, then show how it joins 'Rev' and 'ision' to produce 'Revision'.
  24. 24th May 1983Give one example of an optical secondary storage device.
  25. 25th May 1983Explain the role of TCP when a large file is downloaded.
  26. 26th May 1983State the term used for realistic data that a program would be expected to handle during normal use.
  27. 27th May 1983Define the term 'primary key' as used in a database table.
  28. 28th May 1983State the difference between lossy and lossless compression.
  29. 29th May 1983State the condition that must be met before a binary search can be used on an array.
  30. 30th May 1983A 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 May 1983Convert the 8-bit binary number 10110100 directly to hexadecimal by splitting it into nibbles.