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

January 1961 5-a-day

← Today's GCSE Computer Science sheet

January 1961

31 sheets · 155 questions · GCSE

January 1961 compilationAll answers

Every sheet in January 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 January 1961A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
  2. 2nd January 1961A simple cipher shifts every letter 2 places forward in the alphabet, wrapping around so Y becomes A and Z becomes B. Encrypt the plaintext CAT using this cipher.
  3. 3rd January 1961An array named temps holds 12 values. State the index of the first item and the index of the last item.
  4. 4th January 1961A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
  5. 5th January 1961State the type of program that is typically stored in ROM.
  6. 6th January 1961State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
  7. 7th January 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.
  8. 8th January 1961Write the pseudocode header and body for a function called isAdult that takes one integer parameter called age and returns True if age is 18 or over.
  9. 9th January 1961State the typical maximum capacity of a single-layer DVD.
  10. 10th January 1961State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
  11. 11th January 1961State what is meant by a syntax error.
  12. 12th January 1961State what a foreign key is used for.
  13. 13th January 1961What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
  14. 14th January 1961Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
  15. 15th January 1961Given P = 0 and Q = 1, state the value of P OR Q.
  16. 16th January 1961A 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.
  17. 17th January 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.
  18. 18th January 1961State why a program written in a high level language must be translated.
  19. 19th January 1961Convert the 4-bit binary number 1101 to denary.
  20. 20th January 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.
  21. 21st January 1961State why an organisation might employ penetration testers to test its network.
  22. 22nd January 1961Describe what a nested loop does when it processes a 2D array.
  23. 23rd January 1961State one example of a file format that commonly uses lossy compression.
  24. 24th January 1961State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  25. 25th January 1961State whether the source code of proprietary (closed source) software is normally available for the public to view.
  26. 26th January 1961Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  27. 27th January 1961State the value returned by LENGTH(word) if word stores the string 'Computer'.
  28. 28th January 1961Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  29. 29th January 1961Give two reasons why network communication is divided into layers.
  30. 30th January 1961Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  31. 31st January 1961A 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.