Daily Practice · GCSE Computer Science

March 1979 5-a-day

Every sheet in March 1979

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

  1. 1st March 1979Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  2. 2nd March 1979State one example of a file format that commonly uses lossy compression.
  3. 3rd March 1979State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  4. 4th March 1979State whether the source code of proprietary (closed source) software is normally available for the public to view.
  5. 5th March 1979Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  6. 6th March 1979State the correct order of the three operations used to read data from a text file.
  7. 7th March 1979Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  8. 8th March 1979Name the four layers of the TCP/IP model in order from the one closest to the user.
  9. 9th March 1979Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  10. 10th March 1979A 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.
  11. 11th March 1979Each 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.
  12. 12th March 1979Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  13. 13th March 1979State the two values a Boolean data type can hold.
  14. 14th March 1979Convert the denary number 200 to hexadecimal, showing your working.
  15. 15th March 1979Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  16. 16th March 1979A 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.
  17. 17th March 1979Convert the hexadecimal number 1A to denary.
  18. 18th March 1979Convert the denary number 156 to an 8 bit binary number.
  19. 19th March 1979Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  20. 20th March 1979An array named temps holds 12 values. State the index of the first item and the index of the last item.
  21. 21st March 1979An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  22. 22nd March 1979A 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.
  23. 23rd March 1979Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  24. 24th March 1979Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  25. 25th March 1979State the pseudocode operator commonly used to join (concatenate) two strings, then show how it joins 'Rev' and 'ision' to produce 'Revision'.
  26. 26th March 1979A 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.
  27. 27th March 1979State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  28. 28th March 1979Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  29. 29th March 1979Define the term 'primary key' as used in a database table.
  30. 30th March 1979Define the term 'interrupt' as used to describe a signal received by a CPU.
  31. 31st March 1979An array called items contains [12, 45, 7, 30, 19] at indices 0 to 4. Describe how a linear search would locate the value 30, stating the number of comparisons needed.