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

January 1962 5-a-day

← Today's GCSE Computer Science sheet

January 1962

31 sheets · 155 questions · GCSE

January 1962 compilationAll answers

Every sheet in January 1962

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

  1. 1st January 1962State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  2. 2nd January 1962State whether the source code of proprietary (closed source) software is normally available for the public to view.
  3. 3rd January 1962Write 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 January 1962A 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 January 1962Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  6. 6th January 1962Define the term protocol.
  7. 7th January 1962Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  8. 8th January 1962A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  9. 9th January 1962Each 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 January 1962Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  11. 11th January 1962State the two values a Boolean data type can hold.
  12. 12th January 1962Convert the denary number 39 to an 8-bit binary number, showing your working.
  13. 13th January 1962Calculate 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 January 1962Explain the purpose of a breakpoint.
  15. 15th January 1962Convert the hexadecimal number 1A to denary.
  16. 16th January 1962Convert the denary number 156 to an 8 bit binary number.
  17. 17th January 1962Which 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 January 1962Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  19. 19th January 1962An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  20. 20th January 1962A 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 January 1962Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  22. 22nd January 1962Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  23. 23rd January 1962Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  24. 24th January 1962A 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 January 1962Name the four layers of the TCP/IP model in order from the one closest to the user.
  26. 26th January 1962Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  27. 27th January 1962A 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 January 1962Define the term 'interrupt' as used to describe a signal received by a CPU.
  29. 29th January 1962An 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 January 1962Evaluate X = NOT A AND B when A = 0 and B = 1.
  31. 31st January 1962Convert the hexadecimal number FF to an 8-bit binary number.