Daily Practice · GCSE Computer Science
November 1969 5-a-day
Every sheet in November 1969
The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.
- 1st November 1969State how many different values can be represented using 5 bits, and explain your reasoning.
- 2nd November 1969Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
- 3rd November 1969Explain why an interpreter is often preferred while a program is being written.
- 4th November 1969Convert the hexadecimal number 1A to denary.
- 5th November 1969Convert the denary number 156 to an 8 bit binary number.
- 6th November 1969Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
- 7th November 1969A 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.
- 8th November 1969An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
- 9th November 1969A 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.
- 10th November 1969Describe two negative consequences of throwing away old computer hardware instead of recycling it.
- 11th November 1969Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
- 12th November 1969State the key difference between a procedure and a function.
- 13th November 1969A 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.
- 14th November 1969State the layer that IP operates in, and describe its job.
- 15th November 1969Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
- 16th November 1969Give one advantage of a relational database over a flat-file database.
- 17th November 1969Define the term 'interrupt' as used to describe a signal received by a CPU.
- 18th November 1969An 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.
- 19th November 1969Evaluate X = NOT A AND B when A = 0 and B = 1.
- 20th November 1969Convert the hexadecimal number 3F to denary.
- 21st November 1969Give one advantage of a star topology compared with a mesh topology.
- 22nd November 1969Describe what syntax highlighting is and how it helps a programmer.
- 23rd November 1969Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
- 24th November 1969State the three stages of the fetch-decode-execute cycle in the order they occur.
- 25th November 1969State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
- 26th November 1969Trace 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).
- 27th November 1969Define the term 'pixel'.
- 28th November 1969Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
- 29th November 1969Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
- 30th November 1969Evaluate the expression 23 DIV 4.