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

November 2003 - GCSE Computer Science 5-a-day

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

← Today's GCSE Computer Science sheet

November 2003

30 sheets · 150 questions · GCSE

November 2003 compilationAll answers

Every sheet in November 2003

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

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