Daily Practice · GCSE Computer Science

May 1996 - GCSE Computer Science 5-a-day

Every sheet in May 1996

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

  1. 1st May 1996State one example of a file format that commonly uses lossy compression.
  2. 2nd May 1996State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  3. 3rd May 1996State whether the source code of proprietary (closed source) software is normally available for the public to view.
  4. 4th May 1996Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  5. 5th May 1996A 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.
  6. 6th May 1996Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  7. 7th May 1996State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  8. 8th May 1996Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  9. 9th May 1996A 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;
  10. 10th May 1996Each pair from the previous question is stored using 2 bytes. Calculate the compression ratio achieved, given the uncompressed row (1 byte per pixel) uses 8 bytes.
  11. 11th May 1996Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  12. 12th May 1996State the two values a Boolean data type can hold.
  13. 13th May 1996Convert the 8-bit binary number 01011010 to denary.
  14. 14th May 1996Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  15. 15th May 1996State why a program written in a high level language must be translated.
  16. 16th May 1996Convert the hexadecimal number 1A to denary.
  17. 17th May 1996Convert the denary number 156 to an 8 bit binary number.
  18. 18th May 1996Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  19. 19th May 1996Describe what a nested loop does when it processes a 2D array.
  20. 20th May 1996An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  21. 21st May 1996A CPU's cache has a hit rate of 80%. During a task the CPU makes 4000 requests for data. Calculate the number of cache hits and cache misses.
  22. 22nd May 1996Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  23. 23rd May 1996Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  24. 24th May 1996Write 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.
  25. 25th May 1996A 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.
  26. 26th May 1996Give two reasons why network communication is divided into layers.
  27. 27th May 1996Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  28. 28th May 1996State what a foreign key is used for.
  29. 29th May 1996Define the term 'interrupt' as used to describe a signal received by a CPU.
  30. 30th May 1996An 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.
  31. 31st May 1996Evaluate X = NOT A AND B when A = 0 and B = 1.