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

November 1986 5-a-day

← Today's GCSE Computer Science sheet

November 1986

30 sheets · 150 questions · GCSE

November 1986 compilationAll answers

Every sheet in November 1986

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 1986State what a foreign key is used for.
  2. 2nd November 1986State the difference between lossy and lossless compression.
  3. 3rd November 1986State the condition that must be met before a binary search can be used on an array.
  4. 4th November 1986A 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.
  5. 5th November 1986A 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.
  6. 6th November 1986Which piece of network hardware connects a LAN to another network such as the internet, directing data packets based on IP address?
  7. 7th November 1986A program compiles and runs but always outputs an average that is too small. State the type of error and explain why the translator did not report it.
  8. 8th November 1986Convert the denary number 45 to hexadecimal.
  9. 9th November 1986What does the acronym CPU stand for?
  10. 10th November 1986State what the term malware means.
  11. 11th November 1986An array named temps holds 12 values. State the index of the first item and the index of the last item.
  12. 12th November 1986An 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).
  13. 13th November 1986Which of RAM and ROM is volatile, meaning its contents are lost when the power is removed?
  14. 14th November 1986Which piece of UK legislation controls how organisations must store and use people's personal data?
  15. 15th November 1986Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
  16. 16th November 1986State the value returned by LENGTH(word) if word stores the string 'Computer'.
  17. 17th November 1986Give one reason why RAM on its own is not enough, and a computer also needs secondary storage.
  18. 18th November 1986State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  19. 19th November 1986A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.
  20. 20th November 1986A 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.
  21. 21st November 1986State one function carried out by the operating system of a computer.
  22. 22nd November 1986In computational thinking, what is meant by the term 'decomposition'?
  23. 23rd November 1986Given A = 1 and B = 1, state the value of A AND B.
  24. 24th November 1986State how many different values can be represented using 5 bits, and explain your reasoning.
  25. 25th November 1986Define a peer-to-peer network.
  26. 26th November 1986State why a program written in a high level language must be translated.
  27. 27th November 1986Convert the denary number 5 to a 4-bit binary number.
  28. 28th November 1986A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  29. 29th November 1986A 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.
  30. 30th November 1986Describe what a nested loop does when it processes a 2D array.