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

July 1983 5-a-day

← Today's GCSE Computer Science sheet

July 1983

31 sheets · 155 questions · GCSE

July 1983 compilationAll answers

Every sheet in July 1983

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

  1. 1st July 1983State the typical maximum capacity of a single-layer DVD.
  2. 2nd July 1983Define the term protocol.
  3. 3rd July 1983State what is meant by a syntax error.
  4. 4th July 1983State what a foreign key is used for.
  5. 5th July 1983What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  6. 6th July 1983Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  7. 7th July 1983Given P = 0 and Q = 1, state the value of P OR Q.
  8. 8th July 1983A pseudocode algorithm is: count <- 0, x <- 10, WHILE x > 0, count <- count + 1, x <- x - 3, ENDWHILE, OUTPUT count. Complete a trace table for x and count, laid out as x | count, then state the value output.
  9. 9th July 1983A 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.
  10. 10th July 1983Explain the purpose of a breakpoint.
  11. 11th July 1983Convert the 4-bit binary number 1101 to denary.
  12. 12th July 1983Two 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.
  13. 13th July 1983State why an organisation might employ penetration testers to test its network.
  14. 14th July 1983Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  15. 15th July 1983State one example of a file format that commonly uses lossy compression.
  16. 16th July 1983State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  17. 17th July 1983State whether the source code of proprietary (closed source) software is normally available for the public to view.
  18. 18th July 1983Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  19. 19th July 1983State the value returned by LENGTH(word) if word stores the string 'Computer'.
  20. 20th July 1983Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  21. 21st July 1983Name the four layers of the TCP/IP model in order from the one closest to the user.
  22. 22nd July 1983Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  23. 23rd July 1983A table called books has fields bookId, title, authorId and copiesAvailable. Write an SQL statement that selects the title of every book with more than 2 copies available.
  24. 24th July 1983Each 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.
  25. 25th July 1983Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  26. 26th July 1983State the two values a Boolean data type can hold.
  27. 27th July 1983State how many different values can be represented using 5 bits, and explain your reasoning.
  28. 28th July 1983Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  29. 29th July 1983A 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.
  30. 30th July 1983Convert the hexadecimal number 1A to denary.
  31. 31st July 1983Convert the denary number 156 to an 8 bit binary number.