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

September 1987 5-a-day

← Today's GCSE Computer Science sheet

September 1987

30 sheets · 150 questions · GCSE

September 1987 compilationAll answers

Every sheet in September 1987

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

  1. 1st September 1987State what a foreign key is used for.
  2. 2nd September 1987Define the term 'interrupt' as used to describe a signal received by a CPU.
  3. 3rd September 1987An 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.
  4. 4th September 1987Evaluate X = NOT A AND B when A = 0 and B = 1.
  5. 5th September 1987A 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.
  6. 6th September 1987Give one advantage of a star topology compared with a mesh topology.
  7. 7th September 1987Explain why an interpreter is often preferred while a program is being written.
  8. 8th September 1987Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  9. 9th September 1987State the three stages of the fetch-decode-execute cycle in the order they occur.
  10. 10th September 1987State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  11. 11th September 1987A 2D array grid is declared as grid[4][6]. State how many rows and columns it has and how many elements it holds in total.
  12. 12th September 1987Define the term 'pixel'.
  13. 13th September 1987Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  14. 14th September 1987Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  15. 15th September 1987Evaluate the expression 23 DIV 4.
  16. 16th September 1987State the value returned by LENGTH(word) if word stores the string 'Computer'.
  17. 17th September 1987A 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.
  18. 18th September 1987State the layer that IP operates in, and describe its job.
  19. 19th September 1987A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  20. 20th September 1987A 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.
  21. 21st September 1987A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  22. 22nd September 1987An 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.
  23. 23rd September 1987Complete: NOT 0 = ?
  24. 24th September 1987State how many different values can be represented using 5 bits, and explain your reasoning.
  25. 25th September 1987State what LAN stands for.
  26. 26th September 1987Describe what syntax highlighting is and how it helps a programmer.
  27. 27th September 1987An 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.
  28. 28th September 1987Which CPU register holds the address of the next instruction to be fetched?
  29. 29th September 1987Distinguish between the network security threats known as phishing and pharming.
  30. 30th September 1987Trace 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).