Daily Practice · GCSE Computer Science
January 1956 5-a-day
Every sheet in January 1956
The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.
- 1st January 1956Define a peer-to-peer network.
- 2nd January 1956Explain why an interpreter is often preferred while a program is being written.
- 3rd January 1956Convert the denary number 5 to a 4-bit binary number.
- 4th January 1956A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
- 5th January 1956A 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.
- 6th January 1956A 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.
- 7th January 1956A mono sound clip has a sample rate of 4000 Hz and lasts 2 seconds. Calculate the total number of samples taken.
- 8th January 1956State the type of program that is typically stored in ROM.
- 9th January 1956State one reason a small business might choose to use open source software instead of proprietary (closed source) software.
- 10th January 1956A FOR loop runs: total = 0, FOR i = 1 TO 4, total = total + i, NEXT i. State the value of total after the loop finishes.
- 11th January 1956Write 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.
- 12th January 1956State the typical maximum capacity of a single-layer DVD.
- 13th January 1956State the layer that IP operates in, and describe its job.
- 14th January 1956State what is meant by a syntax error.
- 15th January 1956State what a foreign key is used for.
- 16th January 1956What type of utility software reorganises files on a hard disk so fragmented parts are stored closer together?
- 17th January 1956Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
- 18th January 1956Given P = 0 and Q = 1, state the value of P OR Q.
- 19th January 1956A 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.
- 20th January 1956A 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.
- 21st January 1956Describe what syntax highlighting is and how it helps a programmer.
- 22nd January 1956Convert the 4-bit binary number 1101 to denary.
- 23rd January 1956Two 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.
- 24th January 1956State why an organisation might employ penetration testers to test its network.
- 25th January 1956Trace 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).
- 26th January 1956State one example of a file format that commonly uses lossy compression.
- 27th January 1956State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
- 28th January 1956State whether the source code of proprietary (closed source) software is normally available for the public to view.
- 29th January 1956Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
- 30th January 1956State the value returned by LENGTH(word) if word stores the string 'Computer'.
- 31st January 1956Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.