Daily Practice · GCSE Computer Science
September 1962 5-a-day
Every sheet in September 1962
The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.
- 1st September 1962Convert the denary number 156 to an 8 bit binary number.
- 2nd September 1962Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
- 3rd September 1962Write a loop in pseudocode that outputs every element of a 1D array named names of length 6.
- 4th September 1962An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
- 5th September 1962A 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.
- 6th September 1962Describe two negative consequences of throwing away old computer hardware instead of recycling it.
- 7th September 1962Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
- 8th September 1962Write 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.
- 9th September 1962A company backs up its files onto magnetic tape cartridges, each with a capacity of 3 TB. The company needs to back up 20 TB of data. Calculate the minimum number of cartridges needed.
- 10th September 1962A user reads the same email on a phone and a tablet, and deleting it on one deletes it on the other. Which protocol is in use and why?
- 11th September 1962Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
- 12th September 1962State what a foreign key is used for.
- 13th September 1962Define the term 'interrupt' as used to describe a signal received by a CPU.
- 14th September 1962An array called items contains [12, 45, 7, 30, 19] at indices 0 to 4. Describe how a linear search would locate the value 30, stating the number of comparisons needed.
- 15th September 1962Evaluate X = NOT A AND B when A = 0 and B = 1.
- 16th September 1962A 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.
- 17th September 1962Give one advantage of a star topology compared with a mesh topology.
- 18th September 1962Name the translator used for assembly language and describe how it differs from a compiler.
- 19th September 1962Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
- 20th September 1962State the three stages of the fetch-decode-execute cycle in the order they occur.
- 21st September 1962State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
- 22nd September 1962Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
- 23rd September 1962Define the term 'pixel'.
- 24th September 1962Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
- 25th September 1962Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
- 26th September 1962Evaluate the expression 23 DIV 4.
- 27th September 1962State the value returned by LENGTH(word) if word stores the string 'Computer'.
- 28th September 1962A 1 TB hard disk drive costs 40 pounds. A 500 GB solid-state drive costs 60 pounds. Calculate the cost per gigabyte of each device, and state which is cheaper per GB. Use 1 TB = 1000 GB.
- 29th September 1962Define the term protocol.
- 30th September 1962A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?