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

April 1968 5-a-day

← Today's GCSE Computer Science sheet

April 1968

30 sheets · 150 questions · GCSE

April 1968 compilationAll answers

Every sheet in April 1968

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

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