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

June 1956 5-a-day

← Today's GCSE Computer Science sheet

June 1956

30 sheets · 150 questions · GCSE

June 1956 compilationAll answers

Every sheet in June 1956

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 1956Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  2. 2nd June 1956Describe what syntax highlighting is and how it helps a programmer.
  3. 3rd June 1956Convert the hexadecimal number 1A to denary.
  4. 4th June 1956Convert the denary number 156 to an 8 bit binary number.
  5. 5th June 1956Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  6. 6th June 1956Trace this algorithm with data = [4, 9, 2, 9, 7] and state the final output. total = 0; count = 0; for i = 0 to 4: if data[i] > 5 then total = total + data[i] and count = count + 1; next i; print(total, count).
  7. 7th June 1956An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  8. 8th June 1956A 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.
  9. 9th June 1956Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  10. 10th June 1956Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  11. 11th June 1956Write 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.
  12. 12th June 1956A 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.
  13. 13th June 1956Explain the role of TCP when a large file is downloaded.
  14. 14th June 1956Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  15. 15th June 1956State what a foreign key is used for.
  16. 16th June 1956Define the term 'interrupt' as used to describe a signal received by a CPU.
  17. 17th June 1956An 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.
  18. 18th June 1956Evaluate X = NOT A AND B when A = 0 and B = 1.
  19. 19th June 1956A 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.
  20. 20th June 1956Give one advantage of a star topology compared with a mesh topology.
  21. 21st June 1956Give one advantage and one disadvantage of using a compiler.
  22. 22nd June 1956Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
  23. 23rd June 1956State the three stages of the fetch-decode-execute cycle in the order they occur.
  24. 24th June 1956State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  25. 25th June 1956Write a loop in pseudocode that outputs every element of a 1D array named names of length 6.
  26. 26th June 1956Define the term 'pixel'.
  27. 27th June 1956Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  28. 28th June 1956Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  29. 29th June 1956Evaluate the expression 23 DIV 4.
  30. 30th June 1956State the value returned by LENGTH(word) if word stores the string 'Computer'.