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

April 1982 5-a-day

← Today's GCSE Computer Science sheet

April 1982

30 sheets · 150 questions · GCSE

April 1982 compilationAll answers

Every sheet in April 1982

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 1982State the typical maximum capacity of a single-layer DVD.
  2. 2nd April 1982State the layer that IP operates in, and describe its job.
  3. 3rd April 1982State what is meant by a syntax error.
  4. 4th April 1982State what a foreign key is used for.
  5. 5th April 1982What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  6. 6th April 1982Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  7. 7th April 1982Given P = 0 and Q = 1, state the value of P OR Q.
  8. 8th April 1982A 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 April 1982A 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 April 1982Describe what syntax highlighting is and how it helps a programmer.
  11. 11th April 1982Convert the 4-bit binary number 1101 to denary.
  12. 12th April 1982Two 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 April 1982State why an organisation might employ penetration testers to test its network.
  14. 14th April 1982Trace this algorithm with data = [4, 9, 2, 9, 7] and state the final output. total = 0; count = 0; for i = 0 to 4: if data[i] > 5 then total = total + data[i] and count = count + 1; next i; print(total, count).
  15. 15th April 1982State one example of a file format that commonly uses lossy compression.
  16. 16th April 1982State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  17. 17th April 1982State whether the source code of proprietary (closed source) software is normally available for the public to view.
  18. 18th April 1982Write 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 April 1982State the value returned by LENGTH(word) if word stores the string 'Computer'.
  20. 20th April 1982Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  21. 21st April 1982Explain the role of TCP when a large file is downloaded.
  22. 22nd April 1982Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  23. 23rd April 1982A 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 April 1982Each 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 April 1982Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  26. 26th April 1982State the two values a Boolean data type can hold.
  27. 27th April 1982State how many different values can be represented using 5 bits, and explain your reasoning.
  28. 28th April 1982Calculate 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 April 1982Give one advantage and one disadvantage of using a compiler.
  30. 30th April 1982Convert the hexadecimal number 1A to denary.