Daily Practice · GCSE Computer Science
June 1980 5-a-day
Every sheet in June 1980
The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.
- 1st June 1980State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
- 2nd June 1980State whether the source code of proprietary (closed source) software is normally available for the public to view.
- 3rd June 1980Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
- 4th June 1980State the correct order of the three operations used to read data from a text file.
- 5th June 1980Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
- 6th June 1980State the layer that IP operates in, and describe its job.
- 7th June 1980Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
- 8th June 1980A table called products has fields productId, name, price and stock. Write an SQL statement that changes the price of the product with productId 7 to 15.99.
- 9th June 1980Each pair from the previous question is stored using 2 bytes. Calculate the compression ratio achieved, given the uncompressed row (1 byte per pixel) uses 8 bytes.
- 10th June 1980Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
- 11th June 1980State the two values a Boolean data type can hold.
- 12th June 1980Convert the denary number 200 to hexadecimal, showing your working.
- 13th June 1980Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
- 14th June 1980Describe what syntax highlighting is and how it helps a programmer.
- 15th June 1980Convert the hexadecimal number 1A to denary.
- 16th June 1980Convert the denary number 156 to an 8 bit binary number.
- 17th June 1980Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
- 18th June 1980Trace 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).
- 19th June 1980An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
- 20th June 1980A 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.
- 21st June 1980Describe two negative consequences of throwing away old computer hardware instead of recycling it.
- 22nd June 1980Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
- 23rd June 1980State the pseudocode operator commonly used to join (concatenate) two strings, then show how it joins 'Rev' and 'ision' to produce 'Revision'.
- 24th June 1980A 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.
- 25th June 1980Explain the role of TCP when a large file is downloaded.
- 26th June 1980Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
- 27th June 1980Define the term 'primary key' as used in a database table.
- 28th June 1980Define the term 'interrupt' as used to describe a signal received by a CPU.
- 29th June 1980An 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.
- 30th June 1980Evaluate X = NOT A AND B when A = 0 and B = 1.