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

May 2001 - GCSE Computer Science 5-a-day

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

← Today's GCSE Computer Science sheet

May 2001

31 sheets · 155 questions · GCSE

May 2001 compilationAll answers

Every sheet in May 2001

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