Daily Practice · GCSE Computer Science
June 1971 5-a-day
Every sheet in June 1971
The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.
- 1st June 1971An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
- 2nd June 1971A 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.
- 3rd June 1971Describe two negative consequences of throwing away old computer hardware instead of recycling it.
- 4th June 1971Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
- 5th June 1971Write 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.
- 6th June 1971A 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.
- 7th June 1971A 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?
- 8th June 1971Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
- 9th June 1971State what a foreign key is used for.
- 10th June 1971Define the term 'interrupt' as used to describe a signal received by a CPU.
- 11th June 1971An 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.
- 12th June 1971Evaluate X = NOT A AND B when A = 0 and B = 1.
- 13th June 1971A 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.
- 14th June 1971Give one advantage of a star topology compared with a mesh topology.
- 15th June 1971Name the translator used for assembly language and describe how it differs from a compiler.
- 16th June 1971Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
- 17th June 1971State the three stages of the fetch-decode-execute cycle in the order they occur.
- 18th June 1971State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
- 19th June 1971Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
- 20th June 1971Define the term 'pixel'.
- 21st June 1971Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
- 22nd June 1971Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
- 23rd June 1971Evaluate the expression 23 DIV 4.
- 24th June 1971State the value returned by LENGTH(word) if word stores the string 'Computer'.
- 25th June 1971A 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.
- 26th June 1971Define the term protocol.
- 27th June 1971A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
- 28th June 1971A 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.
- 29th June 1971A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
- 30th June 1971An array contains [9, 2, 6], to be sorted using insertion sort. Show the state of the array after each new element has been inserted into its correct position.