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

May 1989 5-a-day

← Today's GCSE Computer Science sheet

May 1989

31 sheets · 155 questions · GCSE

May 1989 compilationAll answers

Every sheet in May 1989

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

  1. 1st May 1989State what a foreign key is used for.
  2. 2nd May 1989State the difference between lossy and lossless compression.
  3. 3rd May 1989State the condition that must be met before a binary search can be used on an array.
  4. 4th May 1989A 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 May 1989A 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 May 1989Which piece of network hardware connects a LAN to another network such as the internet, directing data packets based on IP address?
  7. 7th May 1989Explain the purpose of a breakpoint.
  8. 8th May 1989Convert the denary number 45 to hexadecimal.
  9. 9th May 1989What does the acronym CPU stand for?
  10. 10th May 1989State what the term malware means.
  11. 11th May 1989Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  12. 12th May 1989An 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 May 1989Which of RAM and ROM is volatile, meaning its contents are lost when the power is removed?
  14. 14th May 1989Which piece of UK legislation controls how organisations must store and use people's personal data?
  15. 15th May 1989Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
  16. 16th May 1989State the value returned by LENGTH(word) if word stores the string 'Computer'.
  17. 17th May 1989Give one reason why RAM on its own is not enough, and a computer also needs secondary storage.
  18. 18th May 1989Name the four layers of the TCP/IP model in order from the one closest to the user.
  19. 19th May 1989A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.
  20. 20th May 1989A 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 May 1989State one function carried out by the operating system of a computer.
  22. 22nd May 1989In computational thinking, what is meant by the term 'decomposition'?
  23. 23rd May 1989Given A = 1 and B = 1, state the value of A AND B.
  24. 24th May 1989State how many different values can be represented using 5 bits, and explain your reasoning.
  25. 25th May 1989Define a peer-to-peer network.
  26. 26th May 1989A 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.
  27. 27th May 1989Convert the denary number 5 to a 4-bit binary number.
  28. 28th May 1989A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  29. 29th May 1989A 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 May 1989An array named temps holds 12 values. State the index of the first item and the index of the last item.
  31. 31st May 1989A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.