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

June 1961 5-a-day

← Today's GCSE Computer Science sheet

June 1961

30 sheets · 150 questions · GCSE

June 1961 compilationAll answers

Every sheet in June 1961

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 1961Convert the hexadecimal number 1A to denary.
  2. 2nd June 1961Convert the denary number 156 to an 8 bit binary number.
  3. 3rd June 1961Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  4. 4th June 1961Describe what a nested loop does when it processes a 2D array.
  5. 5th June 1961An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  6. 6th June 1961A 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.
  7. 7th June 1961Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  8. 8th June 1961Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  9. 9th June 1961Write 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.
  10. 10th June 1961A 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.
  11. 11th June 1961Give two reasons why network communication is divided into layers.
  12. 12th June 1961Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  13. 13th June 1961State what a foreign key is used for.
  14. 14th June 1961Define the term 'interrupt' as used to describe a signal received by a CPU.
  15. 15th June 1961An 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.
  16. 16th June 1961Evaluate X = NOT A AND B when A = 0 and B = 1.
  17. 17th June 1961A 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.
  18. 18th June 1961Give one advantage of a star topology compared with a mesh topology.
  19. 19th June 1961Explain why an interpreter is often preferred while a program is being written.
  20. 20th June 1961Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  21. 21st June 1961State the three stages of the fetch-decode-execute cycle in the order they occur.
  22. 22nd June 1961State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  23. 23rd June 1961A 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.
  24. 24th June 1961Define the term 'pixel'.
  25. 25th June 1961Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  26. 26th June 1961Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  27. 27th June 1961Evaluate the expression 23 DIV 4.
  28. 28th June 1961State the value returned by LENGTH(word) if word stores the string 'Computer'.
  29. 29th June 1961A 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.
  30. 30th June 1961State the layer that IP operates in, and describe its job.