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

March 1980 5-a-day

← Today's GCSE Computer Science sheet

March 1980

31 sheets · 155 questions · GCSE

March 1980 compilationAll answers

Every sheet in March 1980

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 1980Write the pseudocode header and body for a function called isAdult that takes one integer parameter called age and returns True if age is 18 or over.
  2. 2nd March 1980A company backs up its files onto magnetic tape cartridges, each with a capacity of 3 TB. The company needs to back up 20 TB of data. Calculate the minimum number of cartridges needed.
  3. 3rd March 1980A user reads the same email on a phone and a tablet, and deleting it on one deletes it on the other. Which protocol is in use and why?
  4. 4th March 1980Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  5. 5th March 1980State what a foreign key is used for.
  6. 6th March 1980Define the term 'interrupt' as used to describe a signal received by a CPU.
  7. 7th March 1980An 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.
  8. 8th March 1980Evaluate X = NOT A AND B when A = 0 and B = 1.
  9. 9th March 1980A pseudocode algorithm is: count <- 0, x <- 10, WHILE x > 0, count <- count + 1, x <- x - 3, ENDWHILE, OUTPUT count. Complete a trace table for x and count, laid out as x | count, then state the value output.
  10. 10th March 1980Give one advantage of a star topology compared with a mesh topology.
  11. 11th March 1980Name the translator used for assembly language and describe how it differs from a compiler.
  12. 12th March 1980Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  13. 13th March 1980State the three stages of the fetch-decode-execute cycle in the order they occur.
  14. 14th March 1980State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  15. 15th March 1980Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
  16. 16th March 1980Define the term 'pixel'.
  17. 17th March 1980Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  18. 18th March 1980Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  19. 19th March 1980Evaluate the expression 23 DIV 4.
  20. 20th March 1980State the value returned by LENGTH(word) if word stores the string 'Computer'.
  21. 21st March 1980A 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.
  22. 22nd March 1980Define the term protocol.
  23. 23rd March 1980A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  24. 24th March 1980A table called books has fields bookId, title, authorId and copiesAvailable. Write an SQL statement that selects the title of every book with more than 2 copies available.
  25. 25th March 1980A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  26. 26th March 1980An 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.
  27. 27th March 1980Complete: NOT 0 = ?
  28. 28th March 1980State how many different values can be represented using 5 bits, and explain your reasoning.
  29. 29th March 1980State what LAN stands for.
  30. 30th March 1980Explain the purpose of a breakpoint.
  31. 31st March 1980An 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.