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

October 1984 5-a-day

← Today's GCSE Computer Science sheet

October 1984

31 sheets · 155 questions · GCSE

October 1984 compilationAll answers

Every sheet in October 1984

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

  1. 1st October 1984State what is meant by a syntax error.
  2. 2nd October 1984State what a foreign key is used for.
  3. 3rd October 1984What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  4. 4th October 1984Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  5. 5th October 1984Given P = 0 and Q = 1, state the value of P OR Q.
  6. 6th October 1984A 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.
  7. 7th October 1984A 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.
  8. 8th October 1984Explain why an interpreter is often preferred while a program is being written.
  9. 9th October 1984Convert the 4-bit binary number 1101 to denary.
  10. 10th October 1984Two 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.
  11. 11th October 1984State why an organisation might employ penetration testers to test its network.
  12. 12th October 1984A 2D array grid is declared as grid[4][6]. State how many rows and columns it has and how many elements it holds in total.
  13. 13th October 1984State one example of a file format that commonly uses lossy compression.
  14. 14th October 1984State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  15. 15th October 1984State whether the source code of proprietary (closed source) software is normally available for the public to view.
  16. 16th October 1984Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  17. 17th October 1984State the value returned by LENGTH(word) if word stores the string 'Computer'.
  18. 18th October 1984Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  19. 19th October 1984State the layer that IP operates in, and describe its job.
  20. 20th October 1984Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  21. 21st October 1984A 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.
  22. 22nd October 1984Each 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.
  23. 23rd October 1984Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  24. 24th October 1984State the two values a Boolean data type can hold.
  25. 25th October 1984State how many different values can be represented using 5 bits, and explain your reasoning.
  26. 26th October 1984Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  27. 27th October 1984Describe what syntax highlighting is and how it helps a programmer.
  28. 28th October 1984Convert the hexadecimal number 1A to denary.
  29. 29th October 1984Convert the denary number 156 to an 8 bit binary number.
  30. 30th October 1984Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  31. 31st October 1984Trace 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).