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

November 1991 5-a-day

← Today's GCSE Computer Science sheet

November 1991

30 sheets · 150 questions · GCSE

November 1991 compilationAll answers

Every sheet in November 1991

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 1991State the condition that must be met before a binary search can be used on an array.
  2. 2nd November 1991A logic circuit has inputs C and D. C feeds into a NOT gate; the output of the NOT gate and D feed into an OR gate, giving output Y. Write the Boolean expression for Y and state its value when C = 1 and D = 0.
  3. 3rd November 1991A 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.
  4. 4th November 1991Which piece of network hardware connects a LAN to another network such as the internet, directing data packets based on IP address?
  5. 5th November 1991Name the translator used for assembly language and describe how it differs from a compiler.
  6. 6th November 1991Convert the denary number 45 to hexadecimal.
  7. 7th November 1991What does the acronym CPU stand for?
  8. 8th November 1991State what the term malware means.
  9. 9th November 1991Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
  10. 10th November 1991An 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).
  11. 11th November 1991Which of RAM and ROM is volatile, meaning its contents are lost when the power is removed?
  12. 12th November 1991Which piece of UK legislation controls how organisations must store and use people's personal data?
  13. 13th November 1991Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
  14. 14th November 1991State the value returned by LENGTH(word) if word stores the string 'Computer'.
  15. 15th November 1991Give one reason why RAM on its own is not enough, and a computer also needs secondary storage.
  16. 16th November 1991Define the term protocol.
  17. 17th November 1991A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.
  18. 18th November 1991A 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.
  19. 19th November 1991State one function carried out by the operating system of a computer.
  20. 20th November 1991In computational thinking, what is meant by the term 'decomposition'?
  21. 21st November 1991Given A = 1 and B = 1, state the value of A AND B.
  22. 22nd November 1991State how many different values can be represented using 5 bits, and explain your reasoning.
  23. 23rd November 1991Define a peer-to-peer network.
  24. 24th November 1991Explain the purpose of a breakpoint.
  25. 25th November 1991Convert the denary number 5 to a 4-bit binary number.
  26. 26th November 1991A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  27. 27th November 1991A 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.
  28. 28th November 1991Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  29. 29th November 1991A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
  30. 30th November 1991State the type of program that is typically stored in ROM.