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

October 1965 5-a-day

← Today's GCSE Computer Science sheet

October 1965

31 sheets · 155 questions · GCSE

October 1965 compilationAll answers

Every sheet in October 1965

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

  1. 1st October 1965State whether the source code of proprietary (closed source) software is normally available for the public to view.
  2. 2nd October 1965Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  3. 3rd October 1965A 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.
  4. 4th October 1965Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  5. 5th October 1965State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  6. 6th October 1965Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  7. 7th October 1965A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  8. 8th October 1965Each 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.
  9. 9th October 1965Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  10. 10th October 1965State the two values a Boolean data type can hold.
  11. 11th October 1965Convert the denary number 39 to an 8-bit binary number, showing your working.
  12. 12th October 1965Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  13. 13th October 1965State why a program written in a high level language must be translated.
  14. 14th October 1965Convert the hexadecimal number 1A to denary.
  15. 15th October 1965Convert the denary number 156 to an 8 bit binary number.
  16. 16th October 1965Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  17. 17th October 1965Describe what a nested loop does when it processes a 2D array.
  18. 18th October 1965An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  19. 19th October 1965A 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.
  20. 20th October 1965Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  21. 21st October 1965Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  22. 22nd October 1965Give one specific way this code could be refined without changing what it does: a = 5, b = 3, c = a + b, PRINT c
  23. 23rd October 1965A 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.
  24. 24th October 1965Give two reasons why network communication is divided into layers.
  25. 25th October 1965Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  26. 26th October 1965A 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.
  27. 27th October 1965Define the term 'interrupt' as used to describe a signal received by a CPU.
  28. 28th October 1965An 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.
  29. 29th October 1965Evaluate X = NOT A AND B when A = 0 and B = 1.
  30. 30th October 1965Convert the hexadecimal number FF to an 8-bit binary number.
  31. 31st October 1965Give one advantage of a star topology compared with a mesh topology.