Daily Practice · GCSE Computer Science
October 2002 - GCSE Computer Science 5-a-day
Every GCSE Computer Science sheet published in October 2002, with answers. Systems, data representation, networks, algorithms and programming.
Every sheet in October 2002
The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.
- 1st October 2002State the term used for realistic data that a program would be expected to handle during normal use.
- 2nd October 2002Give one advantage of a relational database over a flat-file database.
- 3rd October 2002State the difference between lossy and lossless compression.
- 4th October 2002State the condition that must be met before a binary search can be used on an array.
- 5th October 2002A logic circuit has inputs C and D. C feeds into a NOT gate; the output of the NOT gate and D feed into an OR gate, giving output Y. Write the Boolean expression for Y and state its value when C = 1 and D = 0.
- 6th October 2002Convert the hexadecimal number 3F to denary.
- 7th October 2002Which piece of network hardware connects a LAN to another network such as the internet, directing data packets based on IP address?
- 8th October 2002Name the translator used for assembly language and describe how it differs from a compiler.
- 9th October 2002Convert the denary number 45 to hexadecimal.
- 10th October 2002What does the acronym CPU stand for?
- 11th October 2002State what the term malware means.
- 12th October 2002Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
- 13th October 2002An uncompressed file is 6000 KB. After lossless compression it is 1500 KB. Calculate the compression ratio in the form n:1 (original size : compressed size).
- 14th October 2002Which of RAM and ROM is volatile, meaning its contents are lost when the power is removed?
- 15th October 2002Which piece of UK legislation controls how organisations must store and use people's personal data?
- 16th October 2002Given x = 5 and y = 8, state whether x < y AND x > 0 evaluates to True or False.
- 17th October 2002A programmer wants any syntax error in their program to be reported before the program starts running at all. State whether a compiler or an interpreter behaves this way, and explain why.
- 18th October 2002Give one reason why RAM on its own is not enough, and a computer also needs secondary storage.
- 19th October 2002Define the term protocol.
- 20th October 2002A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.
- 21st October 2002A table called bookings has fields bookingId, customerName and eventDate. Write an SQL statement that deletes the booking with bookingId 45.
- 22nd October 2002State one function carried out by the operating system of a computer.
- 23rd October 2002In computational thinking, what is meant by the term 'decomposition'?
- 24th October 2002Given A = 1 and B = 1, state the value of A AND B.
- 25th October 2002Convert the denary number 39 to an 8-bit binary number, showing your working.
- 26th October 2002Define a peer-to-peer network.
- 27th October 2002Explain the purpose of a breakpoint.
- 28th October 2002Convert the denary number 5 to a 4-bit binary number.
- 29th October 2002A CPU has a clock speed of 4.0 GHz. Calculate how many clock cycles it completes in 2 seconds.
- 30th October 2002A simple cipher shifts every letter 2 places forward in the alphabet, wrapping around so Y becomes A and Z becomes B. Encrypt the plaintext CAT using this cipher.
- 31st October 2002Explain why a running maximum should be initialised to the first element of the array rather than to 0.