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

March 1970 5-a-day

← Today's GCSE Computer Science sheet

March 1970

31 sheets · 155 questions · GCSE

March 1970 compilationAll answers

Every sheet in March 1970

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 1970Describe what a nested loop does when it processes a 2D array.
  2. 2nd March 1970An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  3. 3rd March 1970A 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.
  4. 4th March 1970Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  5. 5th March 1970Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  6. 6th March 1970Write the pseudocode header and body for a function called isAdult that takes one integer parameter called age and returns True if age is 18 or over.
  7. 7th March 1970A 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.
  8. 8th March 1970Give two reasons why network communication is divided into layers.
  9. 9th March 1970Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  10. 10th March 1970State what a foreign key is used for.
  11. 11th March 1970Define the term 'interrupt' as used to describe a signal received by a CPU.
  12. 12th March 1970An 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.
  13. 13th March 1970Evaluate X = NOT A AND B when A = 0 and B = 1.
  14. 14th March 1970A 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.
  15. 15th March 1970Give one advantage of a star topology compared with a mesh topology.
  16. 16th March 1970Explain why an interpreter is often preferred while a program is being written.
  17. 17th March 1970Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  18. 18th March 1970State the three stages of the fetch-decode-execute cycle in the order they occur.
  19. 19th March 1970State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  20. 20th March 1970A 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.
  21. 21st March 1970Define the term 'pixel'.
  22. 22nd March 1970Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  23. 23rd March 1970Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  24. 24th March 1970Evaluate the expression 23 DIV 4.
  25. 25th March 1970State the value returned by LENGTH(word) if word stores the string 'Computer'.
  26. 26th March 1970A 1 TB hard disk drive costs 40 pounds. A 500 GB solid-state drive costs 60 pounds. Calculate the cost per gigabyte of each device, and state which is cheaper per GB. Use 1 TB = 1000 GB.
  27. 27th March 1970State the layer that IP operates in, and describe its job.
  28. 28th March 1970A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  29. 29th March 1970A 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.
  30. 30th March 1970A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  31. 31st March 1970An array contains [9, 2, 6], to be sorted using insertion sort. Show the state of the array after each new element has been inserted into its correct position.