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

August 2002 - GCSE Computer Science 5-a-day

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

← Today's GCSE Computer Science sheet

August 2002

31 sheets · 155 questions · GCSE

August 2002 compilationAll answers

Every sheet in August 2002

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 2002Write 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 August 2002A 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 August 2002Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  4. 4th August 2002Give two reasons why network communication is divided into layers.
  5. 5th August 2002Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  6. 6th August 2002A 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 August 2002Each 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 August 2002Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  9. 9th August 2002State the two values a Boolean data type can hold.
  10. 10th August 2002Convert the 8-bit binary number 01011010 to denary.
  11. 11th August 2002Calculate 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 August 2002Explain why an interpreter is often preferred while a program is being written.
  13. 13th August 2002Convert the hexadecimal number 1A to denary.
  14. 14th August 2002Convert the denary number 156 to an 8 bit binary number.
  15. 15th August 2002Which 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 August 2002A 2D array grid is declared as grid[4][6]. State how many rows and columns it has and how many elements it holds in total.
  17. 17th August 2002An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  18. 18th August 2002A 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 August 2002Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  20. 20th August 2002Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  21. 21st August 2002Write 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 August 2002A 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 August 2002State the layer that IP operates in, and describe its job.
  24. 24th August 2002Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  25. 25th August 2002State what a foreign key is used for.
  26. 26th August 2002Define the term 'interrupt' as used to describe a signal received by a CPU.
  27. 27th August 2002An 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 August 2002Evaluate X = NOT A AND B when A = 0 and B = 1.
  29. 29th August 2002A 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.
  30. 30th August 2002Give one advantage of a star topology compared with a mesh topology.
  31. 31st August 2002Describe what syntax highlighting is and how it helps a programmer.