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

April 1969 5-a-day

← Today's GCSE Computer Science sheet

April 1969

30 sheets · 150 questions · GCSE

April 1969 compilationAll answers

Every sheet in April 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 April 1969Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  2. 2nd April 1969Define the term 'primary key' as used in a database table.
  3. 3rd April 1969Define the term 'interrupt' as used to describe a signal received by a CPU.
  4. 4th April 1969An array called items contains [12, 45, 7, 30, 19] at indices 0 to 4. Describe how a linear search would locate the value 30, stating the number of comparisons needed.
  5. 5th April 1969Evaluate X = NOT A AND B when A = 0 and B = 1.
  6. 6th April 1969Convert the 8-bit binary number 10110100 directly to hexadecimal by splitting it into nibbles.
  7. 7th April 1969Give one advantage of a star topology compared with a mesh topology.
  8. 8th April 1969Name the translator used for assembly language and describe how it differs from a compiler.
  9. 9th April 1969Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  10. 10th April 1969State the three stages of the fetch-decode-execute cycle in the order they occur.
  11. 11th April 1969State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  12. 12th April 1969Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
  13. 13th April 1969Define the term 'pixel'.
  14. 14th April 1969Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  15. 15th April 1969Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  16. 16th April 1969Evaluate the expression 23 DIV 4.
  17. 17th April 1969A function is defined as: FUNCTION addTax(price) RETURN price x 1.2 ENDFUNCTION. Another line of code runs: total <- addTax(20) + addTax(30). Trace both function calls and state the final value of total.
  18. 18th April 1969A 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.
  19. 19th April 1969Define the term protocol.
  20. 20th April 1969A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  21. 21st April 1969A table called staff has fields staffId, name, department and salary, storing these records: staffId | name | department | salary, 1 | Ben | Sales | 24000, 2 | Chloe | IT | 31000, 3 | Dan | Sales | 27000. State which staffId(s) would be returned by: SELECT staffId FROM staff WHERE department = 'Sales' AND salary > 25000;
  22. 22nd April 1969A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  23. 23rd April 1969An 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.
  24. 24th April 1969Complete: NOT 0 = ?
  25. 25th April 1969Convert the 8-bit binary number 01011010 to denary.
  26. 26th April 1969State what LAN stands for.
  27. 27th April 1969Explain the purpose of a breakpoint.
  28. 28th April 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.
  29. 29th April 1969Which CPU register holds the address of the next instruction to be fetched?
  30. 30th April 1969Distinguish between the network security threats known as phishing and pharming.