Daily Practice · GCSE Computer Science

February 2000 - GCSE Computer Science 5-a-day

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

Every sheet in February 2000

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

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