Revision Library
/Subjects/Computer Science/Daily Practice
Daily Practice · GCSE Computer Science

June 2006 - GCSE Computer Science 5-a-day

Every GCSE Computer Science sheet published in June 2006, with answers. Systems, data representation, networks, algorithms and programming.

← Today's GCSE Computer Science sheet

June 2006

30 sheets · 150 questions · GCSE

June 2006 compilationAll answers

Every sheet in June 2006

The same date always regenerates the same five questions, so a sheet you print today is the sheet a classmate prints tomorrow.

  1. 1st June 2006State the three stages of the fetch-decode-execute cycle in the order they occur.
  2. 2nd June 2006State one weakness of a simple shift cipher compared to modern encryption methods used on networks.
  3. 3rd June 2006Explain what happens if a program tries to read index 5 of an array declared with 5 elements.
  4. 4th June 2006Define the term 'pixel'.
  5. 5th June 2006Order these from fastest access speed to slowest: RAM, cache, registers, secondary storage.
  6. 6th June 2006Which piece of UK legislation makes it a criminal offence to gain unauthorised access to a computer system?
  7. 7th June 2006Evaluate the expression 23 DIV 4.
  8. 8th June 2006State the value returned by LENGTH(word) if word stores the string 'Computer'.
  9. 9th June 2006A 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.
  10. 10th June 2006Define the term protocol.
  11. 11th June 2006A 'quantity' field on a website must only accept whole numbers from 1 to 10. Which validation check identifies that 15 has been entered?
  12. 12th June 2006A 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.
  13. 13th June 2006A row of 8 pixels is WWWBBBWW. Use run-length encoding to encode this row as pairs of (colour, run length).
  14. 14th June 2006An 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.
  15. 15th June 2006Complete: NOT 0 = ?
  16. 16th June 2006State how many different values can be represented using 5 bits, and explain your reasoning.
  17. 17th June 2006State what LAN stands for.
  18. 18th June 2006Explain the purpose of a breakpoint.
  19. 19th June 2006An 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.
  20. 20th June 2006Which CPU register holds the address of the next instruction to be fetched?
  21. 21st June 2006Distinguish between the network security threats known as phishing and pharming.
  22. 22nd June 2006Explain why a running maximum should be initialised to the first element of the array rather than to 0.
  23. 23rd June 2006A row of pixels is encoded using run-length encoding as: 3W 4B 3W. State the original row of pixels it represents.
  24. 24th June 2006A photo file is 3.5 MB in size. Calculate its size in kilobytes (KB). Use 1 MB = 1000 KB.
  25. 25th June 2006A 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.
  26. 26th June 2006State the most appropriate data type for storing a person's shoe size if only whole sizes (e.g. 7, 8, 9) are allowed.
  27. 27th June 2006State the key difference between a procedure and a function.
  28. 28th June 2006Give one example of an optical secondary storage device.
  29. 29th June 2006Name the four layers of the TCP/IP model in order from the one closest to the user.
  30. 30th June 2006State the term used for realistic data that a program would be expected to handle during normal use.