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

June 1985 5-a-day

← Today's GCSE Computer Science sheet

June 1985

30 sheets · 150 questions · GCSE

June 1985 compilationAll answers

Every sheet in June 1985

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

  1. 1st June 1985Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  2. 2nd June 1985State the correct order of the three operations used to read data from a text file.
  3. 3rd June 1985Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  4. 4th June 1985State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  5. 5th June 1985Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  6. 6th June 1985A 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.
  7. 7th June 1985Each 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.
  8. 8th June 1985Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  9. 9th June 1985State the two values a Boolean data type can hold.
  10. 10th June 1985Convert the denary number 200 to hexadecimal, showing your working.
  11. 11th June 1985Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  12. 12th June 1985State why a program written in a high level language must be translated.
  13. 13th June 1985Convert the hexadecimal number 1A to denary.
  14. 14th June 1985Convert the denary number 156 to an 8 bit binary number.
  15. 15th June 1985Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  16. 16th June 1985Describe what a nested loop does when it processes a 2D array.
  17. 17th June 1985An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  18. 18th June 1985A 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.
  19. 19th June 1985Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  20. 20th June 1985Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  21. 21st June 1985State the pseudocode operator commonly used to join (concatenate) two strings, then show how it joins 'Rev' and 'ision' to produce 'Revision'.
  22. 22nd June 1985A 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.
  23. 23rd June 1985Give two reasons why network communication is divided into layers.
  24. 24th June 1985Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  25. 25th June 1985Define the term 'primary key' as used in a database table.
  26. 26th June 1985Define the term 'interrupt' as used to describe a signal received by a CPU.
  27. 27th June 1985An 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.
  28. 28th June 1985Evaluate X = NOT A AND B when A = 0 and B = 1.
  29. 29th June 1985Convert the 8-bit binary number 10110100 directly to hexadecimal by splitting it into nibbles.
  30. 30th June 1985Give one advantage of a star topology compared with a mesh topology.