Daily Practice · GCSE Computer Science

November 2011 - GCSE Computer Science 5-a-day

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

Every sheet in November 2011

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 2011An uncompressed file is 6000 KB. After lossless compression it is 1500 KB. Calculate the compression ratio in the form n:1 (original size : compressed size).
  2. 2nd November 2011Which of RAM and ROM is volatile, meaning its contents are lost when the power is removed?
  3. 3rd November 2011Which piece of UK legislation controls how organisations must store and use people's personal data?
  4. 4th November 2011Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
  5. 5th November 2011State the value returned by LENGTH(word) if word stores the string 'Computer'.
  6. 6th November 2011Give one reason why RAM on its own is not enough, and a computer also needs secondary storage.
  7. 7th November 2011A 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?
  8. 8th November 2011A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.
  9. 9th November 2011A table called books has fields bookId, title, authorId and copiesAvailable. Write an SQL statement that selects the title of every book with more than 2 copies available.
  10. 10th November 2011State one function carried out by the operating system of a computer.
  11. 11th November 2011In computational thinking, what is meant by the term 'decomposition'?
  12. 12th November 2011Given A = 1 and B = 1, state the value of A AND B.
  13. 13th November 2011State how many different values can be represented using 5 bits, and explain your reasoning.
  14. 14th November 2011Define a peer-to-peer network.
  15. 15th November 2011Name the translator used for assembly language and describe how it differs from a compiler.
  16. 16th November 2011Convert the denary number 5 to a 4-bit binary number.
  17. 17th November 2011A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  18. 18th November 2011A 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.
  19. 19th November 2011Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
  20. 20th November 2011A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
  21. 21st November 2011State the type of program that is typically stored in ROM.
  22. 22nd November 2011State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
  23. 23rd November 2011A FOR loop runs: total = 0, FOR i = 1 TO 4, total = total + i, NEXT i. State the value of total after the loop finishes.
  24. 24th November 2011State the key difference between a procedure and a function.
  25. 25th November 2011State the typical maximum capacity of a single-layer DVD.
  26. 26th November 2011Define the term protocol.
  27. 27th November 2011State what is meant by a syntax error.
  28. 28th November 2011Give one advantage of a relational database over a flat-file database.
  29. 29th November 2011What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  30. 30th November 2011Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.