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

September 1999 - GCSE Computer Science 5-a-day

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

← Today's GCSE Computer Science sheet

September 1999

30 sheets · 150 questions · GCSE

September 1999 compilationAll answers

Every sheet in September 1999

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

  1. 1st September 1999Which piece of UK legislation controls how organisations must store and use people's personal data?
  2. 2nd September 1999Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
  3. 3rd September 1999A 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 September 1999Give one reason why RAM on its own is not enough, and a computer also needs secondary storage.
  5. 5th September 1999Give two reasons why network communication is divided into layers.
  6. 6th September 1999A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.
  7. 7th September 1999A 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 September 1999State one function carried out by the operating system of a computer.
  9. 9th September 1999In computational thinking, what is meant by the term 'decomposition'?
  10. 10th September 1999Given A = 1 and B = 1, state the value of A AND B.
  11. 11th September 1999Convert the 8-bit binary number 01011010 to denary.
  12. 12th September 1999Define a peer-to-peer network.
  13. 13th September 1999Explain why an interpreter is often preferred while a program is being written.
  14. 14th September 1999Convert the denary number 5 to a 4-bit binary number.
  15. 15th September 1999A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  16. 16th September 1999A simple cipher shifts every letter 2 places forward in the alphabet, wrapping around so Y becomes A and Z becomes B. Encrypt the plaintext CAT using this cipher.
  17. 17th September 1999A 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.
  18. 18th September 1999A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
  19. 19th September 1999State the type of program that is typically stored in ROM.
  20. 20th September 1999State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
  21. 21st September 1999A FOR loop runs: total = 0, FOR i = 1 TO 4, total = total + i, NEXT i. State the value of total after the loop finishes.
  22. 22nd September 1999Write 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 September 1999State the typical maximum capacity of a single-layer DVD.
  24. 24th September 1999State the layer that IP operates in, and describe its job.
  25. 25th September 1999State what is meant by a syntax error.
  26. 26th September 1999State what a foreign key is used for.
  27. 27th September 1999What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  28. 28th September 1999Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  29. 29th September 1999Given P = 0 and Q = 1, state the value of P OR Q.
  30. 30th September 1999A 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.