Daily Practice · GCSE Computer Science

September 1971 5-a-day

Every sheet in September 1971

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

  1. 1st September 1971Two 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.
  2. 2nd September 1971State why an organisation might employ penetration testers to test its network.
  3. 3rd September 1971A 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.
  4. 4th September 1971State one example of a file format that commonly uses lossy compression.
  5. 5th September 1971State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  6. 6th September 1971State whether the source code of proprietary (closed source) software is normally available for the public to view.
  7. 7th September 1971Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  8. 8th September 1971State the correct order of the three operations used to read data from a text file.
  9. 9th September 1971Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  10. 10th September 1971State the layer that IP operates in, and describe its job.
  11. 11th September 1971Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  12. 12th September 1971A table called products has fields productId, name, price and stock. Write an SQL statement that changes the price of the product with productId 7 to 15.99.
  13. 13th September 1971Each 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.
  14. 14th September 1971Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  15. 15th September 1971State the two values a Boolean data type can hold.
  16. 16th September 1971Convert the denary number 200 to hexadecimal, showing your working.
  17. 17th September 1971Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  18. 18th September 1971Describe what syntax highlighting is and how it helps a programmer.
  19. 19th September 1971Convert the hexadecimal number 1A to denary.
  20. 20th September 1971Convert the denary number 156 to an 8 bit binary number.
  21. 21st September 1971Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  22. 22nd September 1971Trace this algorithm with data = [4, 9, 2, 9, 7] and state the final output. total = 0; count = 0; for i = 0 to 4: if data[i] > 5 then total = total + data[i] and count = count + 1; next i; print(total, count).
  23. 23rd September 1971An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  24. 24th September 1971A 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.
  25. 25th September 1971Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  26. 26th September 1971Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  27. 27th September 1971State the pseudocode operator commonly used to join (concatenate) two strings, then show how it joins 'Rev' and 'ision' to produce 'Revision'.
  28. 28th September 1971A company backs up its files onto magnetic tape cartridges, each with a capacity of 3 TB. The company needs to back up 20 TB of data. Calculate the minimum number of cartridges needed.
  29. 29th September 1971Explain the role of TCP when a large file is downloaded.
  30. 30th September 1971Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.