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

November 1973 5-a-day

← Today's GCSE Computer Science sheet

November 1973

30 sheets · 150 questions · GCSE

November 1973 compilationAll answers

Every sheet in November 1973

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

  1. 1st November 1973Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  2. 2nd November 1973Given P = 0 and Q = 1, state the value of P OR Q.
  3. 3rd November 1973Convert the 8-bit binary number 10110100 directly to hexadecimal by splitting it into nibbles.
  4. 4th November 1973A 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.
  5. 5th November 1973Explain why an interpreter is often preferred while a program is being written.
  6. 6th November 1973Convert the 4-bit binary number 1101 to denary.
  7. 7th November 1973Two 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.
  8. 8th November 1973State why an organisation might employ penetration testers to test its network.
  9. 9th November 1973A 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.
  10. 10th November 1973State one example of a file format that commonly uses lossy compression.
  11. 11th November 1973State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  12. 12th November 1973State whether the source code of proprietary (closed source) software is normally available for the public to view.
  13. 13th November 1973Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  14. 14th November 1973A 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.
  15. 15th November 1973Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  16. 16th November 1973State the layer that IP operates in, and describe its job.
  17. 17th November 1973Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  18. 18th November 1973A 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;
  19. 19th November 1973Each 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.
  20. 20th November 1973Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  21. 21st November 1973State the two values a Boolean data type can hold.
  22. 22nd November 1973Convert the 8-bit binary number 01011010 to denary.
  23. 23rd November 1973Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  24. 24th November 1973Describe what syntax highlighting is and how it helps a programmer.
  25. 25th November 1973Convert the hexadecimal number 1A to denary.
  26. 26th November 1973Convert the denary number 156 to an 8 bit binary number.
  27. 27th November 1973Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  28. 28th November 1973Trace 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).
  29. 29th November 1973An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  30. 30th November 1973A CPU's cache has a hit rate of 80%. During a task the CPU makes 4000 requests for data. Calculate the number of cache hits and cache misses.