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

July 1964 5-a-day

← Today's GCSE Computer Science sheet

July 1964

31 sheets · 155 questions · GCSE

July 1964 compilationAll answers

Every sheet in July 1964

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

  1. 1st July 1964State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  2. 2nd July 1964State whether the source code of proprietary (closed source) software is normally available for the public to view.
  3. 3rd July 1964Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  4. 4th July 1964A programmer wants any syntax error in their program to be reported before the program starts running at all. State whether a compiler or an interpreter behaves this way, and explain why.
  5. 5th July 1964Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  6. 6th July 1964A user reads the same email on a phone and a tablet, and deleting it on one deletes it on the other. Which protocol is in use and why?
  7. 7th July 1964Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  8. 8th July 1964A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  9. 9th July 1964Each 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.
  10. 10th July 1964Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  11. 11th July 1964State the two values a Boolean data type can hold.
  12. 12th July 1964Convert the denary number 39 to an 8-bit binary number, showing your working.
  13. 13th July 1964Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  14. 14th July 1964Name the translator used for assembly language and describe how it differs from a compiler.
  15. 15th July 1964Convert the hexadecimal number 1A to denary.
  16. 16th July 1964Convert the denary number 156 to an 8 bit binary number.
  17. 17th July 1964Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  18. 18th July 1964Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
  19. 19th July 1964An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  20. 20th July 1964A 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.
  21. 21st July 1964Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  22. 22nd July 1964Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  23. 23rd July 1964Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  24. 24th July 1964A 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.
  25. 25th July 1964Define the term protocol.
  26. 26th July 1964Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  27. 27th July 1964A table called members has fields memberId, firstName, lastName and joinYear. Write an SQL statement that adds a new record with memberId 12, firstName 'Priya', lastName 'Shah' and joinYear 2026.
  28. 28th July 1964Define the term 'interrupt' as used to describe a signal received by a CPU.
  29. 29th July 1964An 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.
  30. 30th July 1964Evaluate X = NOT A AND B when A = 0 and B = 1.
  31. 31st July 1964Convert the hexadecimal number FF to an 8-bit binary number.