Daily Practice · GCSE Computer Science

May 1961 5-a-day

Every sheet in May 1961

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

  1. 1st May 1961A FOR loop runs: total = 0, FOR i = 1 TO 4, total = total + i, NEXT i. State the value of total after the loop finishes.
  2. 2nd May 1961State the pseudocode operator commonly used to join (concatenate) two strings, then show how it joins 'Rev' and 'ision' to produce 'Revision'.
  3. 3rd May 1961State the typical maximum capacity of a single-layer DVD.
  4. 4th May 1961Name the four layers of the TCP/IP model in order from the one closest to the user.
  5. 5th May 1961State what is meant by a syntax error.
  6. 6th May 1961Define the term 'primary key' as used in a database table.
  7. 7th May 1961What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  8. 8th May 1961Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  9. 9th May 1961Given P = 0 and Q = 1, state the value of P OR Q.
  10. 10th May 1961Convert the 8-bit binary number 10110100 directly to hexadecimal by splitting it into nibbles.
  11. 11th May 1961A 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.
  12. 12th May 1961A 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 May 1961Convert the 4-bit binary number 1101 to denary.
  14. 14th May 1961Two 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.
  15. 15th May 1961State why an organisation might employ penetration testers to test its network.
  16. 16th May 1961An array named temps holds 12 values. State the index of the first item and the index of the last item.
  17. 17th May 1961State one example of a file format that commonly uses lossy compression.
  18. 18th May 1961State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  19. 19th May 1961State whether the source code of proprietary (closed source) software is normally available for the public to view.
  20. 20th May 1961Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  21. 21st May 1961A function is defined as: FUNCTION addTax(price) RETURN price x 1.2 ENDFUNCTION. Another line of code runs: total <- addTax(20) + addTax(30). Trace both function calls and state the final value of total.
  22. 22nd May 1961Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  23. 23rd May 1961State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  24. 24th May 1961Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  25. 25th May 1961A table called staff has fields staffId, name, department and salary, storing these records: staffId | name | department | salary, 1 | Ben | Sales | 24000, 2 | Chloe | IT | 31000, 3 | Dan | Sales | 27000. State which staffId(s) would be returned by: SELECT staffId FROM staff WHERE department = 'Sales' AND salary > 25000;
  26. 26th May 1961Each 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.
  27. 27th May 1961Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  28. 28th May 1961State the two values a Boolean data type can hold.
  29. 29th May 1961Convert the 8-bit binary number 01011010 to denary.
  30. 30th May 1961Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  31. 31st May 1961State why a program written in a high level language must be translated.