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

February 1967 5-a-day

← Today's GCSE Computer Science sheet

February 1967

28 sheets · 140 questions · GCSE

February 1967 compilationAll answers

Every sheet in February 1967

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

  1. 1st February 1967Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  2. 2nd February 1967State the three stages of the fetch-decode-execute cycle in the order they occur.
  3. 3rd February 1967State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  4. 4th February 1967Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
  5. 5th February 1967Define the term 'pixel'.
  6. 6th February 1967Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  7. 7th February 1967Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  8. 8th February 1967Evaluate the expression 23 DIV 4.
  9. 9th February 1967State the correct order of the three operations used to read data from a text file.
  10. 10th February 1967A 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.
  11. 11th February 1967Define the term protocol.
  12. 12th February 1967A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  13. 13th February 1967A 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.
  14. 14th February 1967A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  15. 15th February 1967An 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.
  16. 16th February 1967Complete: NOT 0 = ?
  17. 17th February 1967Convert the denary number 200 to hexadecimal, showing your working.
  18. 18th February 1967State what LAN stands for.
  19. 19th February 1967Explain the purpose of a breakpoint.
  20. 20th February 1967An 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.
  21. 21st February 1967Which CPU register holds the address of the next instruction to be fetched?
  22. 22nd February 1967Distinguish between the network security threats known as phishing and pharming.
  23. 23rd February 1967Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  24. 24th February 1967A row of pixels is encoded using run-length encoding as: 3W 4B 3W. State the original row of pixels it represents.
  25. 25th February 1967A photo file is 3.5 MB in size. Calculate its size in kilobytes (KB). Use 1 MB = 1000 KB.
  26. 26th February 1967A 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.
  27. 27th February 1967State the most appropriate data type for storing a person's shoe size if only whole sizes (e.g. 7, 8, 9) are allowed.
  28. 28th February 1967State the pseudocode operator commonly used to join (concatenate) two strings, then show how it joins 'Rev' and 'ision' to produce 'Revision'.