Daily Practice · GCSE Computer Science

June 1989 5-a-day

Every sheet in June 1989

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 1989State the type of program that is typically stored in ROM.
  2. 2nd June 1989State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
  3. 3rd June 1989A FOR loop runs: total = 0, FOR i = 1 TO 4, total = total + i, NEXT i. State the value of total after the loop finishes.
  4. 4th June 1989State the key difference between a procedure and a function.
  5. 5th June 1989State the typical maximum capacity of a single-layer DVD.
  6. 6th June 1989State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  7. 7th June 1989State what is meant by a syntax error.
  8. 8th June 1989Give one advantage of a relational database over a flat-file database.
  9. 9th June 1989What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  10. 10th June 1989Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  11. 11th June 1989Given P = 0 and Q = 1, state the value of P OR Q.
  12. 12th June 1989Convert the hexadecimal number 3F to denary.
  13. 13th June 1989A network administrator is connecting 10 computers in a server room. Calculate the number of cables needed for a full mesh topology, and state the number needed for a star topology with one central switch.
  14. 14th June 1989State why a program written in a high level language must be translated.
  15. 15th June 1989Convert the 4-bit binary number 1101 to denary.
  16. 16th June 1989Two CPUs are compared for a task optimised for multiple cores: CPU A has 2 cores at 4.2 GHz; CPU B has 6 cores at 3.0 GHz. Explain which CPU is likely to perform better for this task.
  17. 17th June 1989State why an organisation might employ penetration testers to test its network.
  18. 18th June 1989Describe what a nested loop does when it processes a 2D array.
  19. 19th June 1989State one example of a file format that commonly uses lossy compression.
  20. 20th June 1989State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  21. 21st June 1989State whether the source code of proprietary (closed source) software is normally available for the public to view.
  22. 22nd June 1989Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  23. 23rd June 1989A 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.
  24. 24th June 1989Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  25. 25th June 1989Give two reasons why network communication is divided into layers.
  26. 26th June 1989Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  27. 27th June 1989A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
  28. 28th June 1989Each 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.
  29. 29th June 1989Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  30. 30th June 1989State the two values a Boolean data type can hold.