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

March 1975 5-a-day

← Today's GCSE Computer Science sheet

March 1975

31 sheets · 155 questions · GCSE

March 1975 compilationAll answers

Every sheet in March 1975

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 1975A 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.
  2. 2nd March 1975Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  3. 3rd March 1975Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  4. 4th March 1975Write 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.
  5. 5th March 1975A 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.
  6. 6th March 1975Name the four layers of the TCP/IP model in order from the one closest to the user.
  7. 7th March 1975Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  8. 8th March 1975State what a foreign key is used for.
  9. 9th March 1975Define the term 'interrupt' as used to describe a signal received by a CPU.
  10. 10th March 1975An 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.
  11. 11th March 1975Evaluate X = NOT A AND B when A = 0 and B = 1.
  12. 12th March 1975A 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.
  13. 13th March 1975Give one advantage of a star topology compared with a mesh topology.
  14. 14th March 1975A 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.
  15. 15th March 1975Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  16. 16th March 1975State the three stages of the fetch-decode-execute cycle in the order they occur.
  17. 17th March 1975State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  18. 18th March 1975An array named temps holds 12 values. State the index of the first item and the index of the last item.
  19. 19th March 1975Define the term 'pixel'.
  20. 20th March 1975Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  21. 21st March 1975Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  22. 22nd March 1975Evaluate the expression 23 DIV 4.
  23. 23rd March 1975State the value returned by LENGTH(word) if word stores the string 'Computer'.
  24. 24th March 1975A 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.
  25. 25th March 1975State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  26. 26th March 1975A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  27. 27th March 1975A 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.
  28. 28th March 1975A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  29. 29th March 1975An 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.
  30. 30th March 1975Complete: NOT 0 = ?
  31. 31st March 1975State how many different values can be represented using 5 bits, and explain your reasoning.