Daily Practice · GCSE Computer Science

August 1997 - GCSE Computer Science 5-a-day

Every sheet in August 1997

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

  1. 1st August 1997State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  2. 2nd August 1997State whether the source code of proprietary (closed source) software is normally available for the public to view.
  3. 3rd August 1997Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  4. 4th August 1997A 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 August 1997Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  6. 6th August 1997Explain the role of TCP when a large file is downloaded.
  7. 7th August 1997Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  8. 8th August 1997A 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 August 1997Each 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.
  10. 10th August 1997Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  11. 11th August 1997State the two values a Boolean data type can hold.
  12. 12th August 1997Convert the 8-bit binary number 01011010 to denary.
  13. 13th August 1997Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  14. 14th August 1997Give one advantage and one disadvantage of using a compiler.
  15. 15th August 1997Convert the hexadecimal number 1A to denary.
  16. 16th August 1997Convert the denary number 156 to an 8 bit binary number.
  17. 17th August 1997Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  18. 18th August 1997Write a loop in pseudocode that outputs every element of a 1D array named names of length 6.
  19. 19th August 1997An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  20. 20th August 1997A 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.
  21. 21st August 1997Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  22. 22nd August 1997Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  23. 23rd August 1997Write 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 August 1997A 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.
  25. 25th August 1997A 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?
  26. 26th August 1997Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  27. 27th August 1997State what a foreign key is used for.
  28. 28th August 1997Define the term 'interrupt' as used to describe a signal received by a CPU.
  29. 29th August 1997An 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.
  30. 30th August 1997Evaluate X = NOT A AND B when A = 0 and B = 1.
  31. 31st August 1997A 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.