Daily Practice · GCSE Computer Science
June 2001 - GCSE Computer Science 5-a-day
Every GCSE Computer Science sheet published in June 2001, with answers. Systems, data representation, networks, algorithms and programming.
Every sheet in June 2001
The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.
- 1st June 2001A program compiles and runs but always outputs an average that is too small. State the type of error and explain why the translator did not report it.
- 2nd June 2001Add the 8-bit binary numbers 00101101 and 00010011, giving your answer as an 8-bit binary number.
- 3rd June 2001State the three stages of the fetch-decode-execute cycle in the order they occur.
- 4th June 2001State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
- 5th June 2001An array named temps holds 12 values. State the index of the first item and the index of the last item.
- 6th June 2001Define the term 'pixel'.
- 7th June 2001Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
- 8th June 2001Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
- 9th June 2001Evaluate the expression 23 DIV 4.
- 10th June 2001State the value returned by LENGTH(word) if word stores the string 'Computer'.
- 11th June 2001A 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.
- 12th June 2001State the difference between HTTP and HTTPS, and give one situation where HTTPS is essential.
- 13th June 2001A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
- 14th June 2001A 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.
- 15th June 2001A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
- 16th June 2001An 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.
- 17th June 2001Complete: NOT 0 = ?
- 18th June 2001State how many different values can be represented using 5 bits, and explain your reasoning.
- 19th June 2001State what LAN stands for.
- 20th June 2001State why a program written in a high level language must be translated.
- 21st June 2001An 8-bit register stores the value 01100000 (denary 96). State the resulting 8-bit binary value after a left shift by 1 place, and state whether an overflow occurs.
- 22nd June 2001Which CPU register holds the address of the next instruction to be fetched?
- 23rd June 2001Distinguish between the network security threats known as phishing and pharming.
- 24th June 2001Describe what a nested loop does when it processes a 2D array.
- 25th June 2001A row of pixels is encoded using run-length encoding as: 3W 4B 3W. State the original row of pixels it represents.
- 26th June 2001A photo file is 3.5 MB in size. Calculate its size in kilobytes (KB). Use 1 MB = 1000 KB.
- 27th June 2001A streaming company records which shows each user watches and uses this to recommend similar shows. Explain one ethical concern this could raise, even if the company only uses the data to improve recommendations.
- 28th June 2001State the most appropriate data type for storing a person's shoe size if only whole sizes (e.g. 7, 8, 9) are allowed.
- 29th June 2001State the key difference between a procedure and a function.
- 30th June 2001Give one example of an optical secondary storage device.