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

April 1999 - GCSE Computer Science 5-a-day

Every GCSE Computer Science sheet published in April 1999, with answers. Systems, data representation, networks, algorithms and programming.

← Today's GCSE Computer Science sheet

April 1999

30 sheets · 150 questions · GCSE

April 1999 compilationAll answers

Every sheet in April 1999

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 1999Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  2. 2nd April 1999Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  3. 3rd April 1999Evaluate the expression 23 DIV 4.
  4. 4th April 1999A 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.
  5. 5th April 1999A 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 April 1999State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  7. 7th April 1999A '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 April 1999A 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;
  9. 9th April 1999A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  10. 10th April 1999An 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 April 1999Complete: NOT 0 = ?
  12. 12th April 1999Convert the 8-bit binary number 01011010 to denary.
  13. 13th April 1999State what LAN stands for.
  14. 14th April 1999State why a program written in a high level language must be translated.
  15. 15th April 1999An 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 April 1999Which CPU register holds the address of the next instruction to be fetched?
  17. 17th April 1999Distinguish between the network security threats known as phishing and pharming.
  18. 18th April 1999Describe what a nested loop does when it processes a 2D array.
  19. 19th April 1999A row of pixels is encoded using run-length encoding as: 3W 4B 3W. State the original row of pixels it represents.
  20. 20th April 1999A photo file is 3.5 MB in size. Calculate its size in kilobytes (KB). Use 1 MB = 1000 KB.
  21. 21st April 1999A 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 April 1999State 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 April 1999Write 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.
  24. 24th April 1999Give one example of an optical secondary storage device.
  25. 25th April 1999Give two reasons why network communication is divided into layers.
  26. 26th April 1999State the term used for realistic data that a program would be expected to handle during normal use.
  27. 27th April 1999State what a foreign key is used for.
  28. 28th April 1999State the difference between lossy and lossless compression.
  29. 29th April 1999State the condition that must be met before a binary search can be used on an array.
  30. 30th April 1999A 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.