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

November 1981 5-a-day

← Today's GCSE Computer Science sheet

November 1981

30 sheets · 150 questions · GCSE

November 1981 compilationAll answers

Every sheet in November 1981

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 1981Give two reasons why network communication is divided into layers.
  2. 2nd November 1981State the term used for realistic data that a program would be expected to handle during normal use.
  3. 3rd November 1981State what a foreign key is used for.
  4. 4th November 1981State the difference between lossy and lossless compression.
  5. 5th November 1981State the condition that must be met before a binary search can be used on an array.
  6. 6th November 1981A 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.
  7. 7th November 1981A 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.
  8. 8th November 1981Which piece of network hardware connects a LAN to another network such as the internet, directing data packets based on IP address?
  9. 9th November 1981Explain why an interpreter is often preferred while a program is being written.
  10. 10th November 1981Convert the denary number 45 to hexadecimal.
  11. 11th November 1981What does the acronym CPU stand for?
  12. 12th November 1981State what the term malware means.
  13. 13th November 1981A 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.
  14. 14th November 1981An 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).
  15. 15th November 1981Which of RAM and ROM is volatile, meaning its contents are lost when the power is removed?
  16. 16th November 1981Which piece of UK legislation controls how organisations must store and use people's personal data?
  17. 17th November 1981Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
  18. 18th November 1981State the value returned by LENGTH(word) if word stores the string 'Computer'.
  19. 19th November 1981Give one reason why RAM on its own is not enough, and a computer also needs secondary storage.
  20. 20th November 1981State the layer that IP operates in, and describe its job.
  21. 21st November 1981A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.
  22. 22nd November 1981A 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.
  23. 23rd November 1981State one function carried out by the operating system of a computer.
  24. 24th November 1981In computational thinking, what is meant by the term 'decomposition'?
  25. 25th November 1981Given A = 1 and B = 1, state the value of A AND B.
  26. 26th November 1981State how many different values can be represented using 5 bits, and explain your reasoning.
  27. 27th November 1981Define a peer-to-peer network.
  28. 28th November 1981Describe what syntax highlighting is and how it helps a programmer.
  29. 29th November 1981Convert the denary number 5 to a 4-bit binary number.
  30. 30th November 1981A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.