Daily Practice · GCSE Computer Science

October 1994 - GCSE Computer Science 5-a-day

Every sheet in October 1994

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

  1. 1st October 1994Given P = 0 and Q = 1, state the value of P OR Q.
  2. 2nd October 1994A 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.
  3. 3rd October 1994A network administrator is connecting 10 computers in a server room. Calculate the number of cables needed for a full mesh topology, and state the number needed for a star topology with one central switch.
  4. 4th October 1994Name the translator used for assembly language and describe how it differs from a compiler.
  5. 5th October 1994Convert the 4-bit binary number 1101 to denary.
  6. 6th October 1994Two CPUs are compared for a task optimised for multiple cores: CPU A has 2 cores at 4.2 GHz; CPU B has 6 cores at 3.0 GHz. Explain which CPU is likely to perform better for this task.
  7. 7th October 1994State why an organisation might employ penetration testers to test its network.
  8. 8th October 1994Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
  9. 9th October 1994State one example of a file format that commonly uses lossy compression.
  10. 10th October 1994State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  11. 11th October 1994State whether the source code of proprietary (closed source) software is normally available for the public to view.
  12. 12th October 1994Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  13. 13th October 1994State the value returned by LENGTH(word) if word stores the string 'Computer'.
  14. 14th October 1994Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  15. 15th October 1994Define the term protocol.
  16. 16th October 1994Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  17. 17th October 1994A 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.
  18. 18th October 1994Each pair from the previous question is stored using 2 bytes. Calculate the compression ratio achieved, given the uncompressed row (1 byte per pixel) uses 8 bytes.
  19. 19th October 1994Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  20. 20th October 1994State the two values a Boolean data type can hold.
  21. 21st October 1994State how many different values can be represented using 5 bits, and explain your reasoning.
  22. 22nd October 1994Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  23. 23rd October 1994Explain the purpose of a breakpoint.
  24. 24th October 1994Convert the hexadecimal number 1A to denary.
  25. 25th October 1994Convert the denary number 156 to an 8 bit binary number.
  26. 26th October 1994Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  27. 27th October 1994Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  28. 28th October 1994An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  29. 29th October 1994A CPU's cache has a hit rate of 80%. During a task the CPU makes 4000 requests for data. Calculate the number of cache hits and cache misses.
  30. 30th October 1994Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  31. 31st October 1994Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.