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

January 2011 - GCSE Computer Science 5-a-day

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

← Today's GCSE Computer Science sheet

January 2011

31 sheets · 155 questions · GCSE

January 2011 compilationAll answers

Every sheet in January 2011

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

  1. 1st January 2011State one example of a file format that commonly uses lossy compression.
  2. 2nd January 2011State how many bits are in one byte, and how many bytes are in one kibibyte (KiB).
  3. 3rd January 2011State whether the source code of proprietary (closed source) software is normally available for the public to view.
  4. 4th January 2011Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
  5. 5th January 2011State the value returned by LENGTH(word) if word stores the string 'Computer'.
  6. 6th January 2011Order these units of data from smallest to largest: megabyte, byte, gigabyte, kilobyte.
  7. 7th January 2011State the layer that IP operates in, and describe its job.
  8. 8th January 2011Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.
  9. 9th January 2011A 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.
  10. 10th January 2011Each 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.
  11. 11th January 2011Which flowchart symbol shape is used to represent a decision point (e.g. a yes/no branch)?
  12. 12th January 2011State the two values a Boolean data type can hold.
  13. 13th January 2011State how many different values can be represented using 5 bits, and explain your reasoning.
  14. 14th January 2011Calculate the number of cables needed to connect 8 computers in a full mesh topology, where every computer connects directly to every other computer.
  15. 15th January 2011Describe what syntax highlighting is and how it helps a programmer.
  16. 16th January 2011Convert the hexadecimal number 1A to denary.
  17. 17th January 2011Convert the denary number 156 to an 8 bit binary number.
  18. 18th January 2011Which type of malware can replicate itself and spread across a network without attaching to another program or needing a user to run it?
  19. 19th January 2011Trace 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).
  20. 20th January 2011An image uses a colour depth of 2 bits per pixel. Calculate the maximum number of different colours it can represent.
  21. 21st January 2011A 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.
  22. 22nd January 2011Describe two negative consequences of throwing away old computer hardware instead of recycling it.
  23. 23rd January 2011Write a function called isEven that takes one integer parameter, num, and returns True if num is even and False otherwise.
  24. 24th January 2011State the key difference between a procedure and a function.
  25. 25th January 2011A 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.
  26. 26th January 2011Explain the role of TCP when a large file is downloaded.
  27. 27th January 2011Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.
  28. 28th January 2011Give one advantage of a relational database over a flat-file database.
  29. 29th January 2011Define the term 'interrupt' as used to describe a signal received by a CPU.
  30. 30th January 2011An 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.
  31. 31st January 2011Evaluate X = NOT A AND B when A = 0 and B = 1.