Data Representation: Number Systems - Worksheets, Questions and Revision
15 original exam-style questions - 7 pages of questions with a full mark scheme - free printable PDF.
Data Representation: Number Systems revision guideMore GCSE Computer Science practiceMock exams
This topic is chapter 3 of GCSE Computer Science Topic Workbook 2 and chapter 13 of GCSE Computer Science 10-Minute Tests.
2.5 Data Representation: Number Systems
| Denary | Binary (8-bit) | Hexadecimal |
|---|---|---|
| 100 | ? | ? |
| ? | 01011001 | ? |
| ? | ? | 7D |
Question 1
- (a) 0110 caoB1
- (a) Answer: 0110
- (b) 11 caoB1
- (b) Answer: 11
- (c) correct place values identified, e.g. 128+64+32+16+8+2 = 250M1
- (c) 11111010 caoA1
- (c) Answer: 11111010
Question 2
- (a) 58 divided by 16 to give 3 remainder 10 (i.e. 3 and A) shownM1
- (a) 3A caoA1
- (a) Answer: 3A
- (b) 2x16 and F(=15)x1 identifiedM1
- (b) 47 caoA1
- (b) Answer: 47
- (c) 15 (F) caoB1
- (c) Answer: 15
Question 3
- (a) binary correctly split into nibbles 1011 and 0101M1
- (a) B5 caoA1
- (a) Answer: B5
- (b) E = 1110 and 3 = 0011 identifiedM1
- (b) 11100011 caoA1
- (b) Answer: 11100011
Question 4
- hexadecimal numbers are much shorter/more compact than the equivalent binary number oeB1
- long strings of binary digits are difficult for people to read/write accurately, so hexadecimal reduces the chance of transcription errors oeB1
- each hexadecimal digit maps directly onto a 4-bit nibble, so converting between binary and hexadecimal is quick and does not need a calculator oeB1
- Answer: Hexadecimal is much shorter than binary for the same value, so it is quicker and less error-prone for people to read and write. It also converts to and from binary very quickly, because each hex digit represents exactly one 4-bit nibble.
Question 5
- (a) bit, nibble, byte, kilobyte cao (all four correct, in this order)B1
- (a) Answer: bit, nibble, byte, kilobyte
- (b) 8 caoB1
- (b) Answer: 8
- (c) 4 x 1000 x 8 shown, or equivalent staged workingM1
- (c) 32000 caoA1
- (c) Answer: 32000 bits
Question 6
- correct place values identified: 128, 64, 8 and 1M1
- 128+64+8+1 = 201 shown csoA1
- Answer: 201 (given, cso)
Question 7
- (a) 8x16 and C(=12)x1 identifiedM1
- (a) 140 caoA1
- (a) Answer: 140
- (b) any valid example, e.g. MAC addresses, error/exception codes, memory addresses, or web page/URL character encoding oeB1
- (b) Answer: MAC addresses (or memory addresses, or error codes)
Question 8
- row 1 binary: 01100100 caoB1
- row 1 hexadecimal: 64 cao (ft from their binary if consistent)B1
- row 2 denary: 89 caoB1
- row 2 hexadecimal: 59 cao (ft from the given binary)B1
- row 3 denary: 125 caoB1
- row 3 binary: 01111101 cao (ft from their denary if consistent)B1
- Answer: Row 1: 100 = 01100100 = 64 (hex); Row 2: 01011001 = 89 = 59 (hex); Row 3: 125 = 01111101 = 7D (hex)
Question 9
- (a) 2n caoB1
- (a) Answer: 2n
- (b) 25 shown, or doubling shown (2,4,8,16,32)M1
- (b) 32 caoA1
- (b) Answer: 32
- (c) 216 identified or calculated as 65536M1
- (c) 65535 caoA1
- (c) Answer: 65535
Question 10
- (a) correct column addition attempted with carries shown/propagated correctlyM1
- (a) 100000101 caoA1
- (a) Answer: 100000101
- (b) 00000101 (5) stated as the stored 8-bit value, ft from their 9-bit answer to (a)B1
- (b) the true result (261) is greater than the maximum value (255) that an 8-bit register can hold, so the extra (9th) bit is lost/discarded and the stored value is incorrect oeB1
- (b) Answer: 00000101 (denary 5) would be stored; this is an overflow error because the true result, 261, is too large to fit in 8 bits (max 255), so the leading bit is lost and the stored value is wrong.
Question 11
- (a) B = 1011 and 4 = 0100 identifiedM1
- (a) 10110100 caoA1
- (a) Answer: 10110100
- (b) correct place values identified, e.g. 128+32+16+4M1
- (b) 180 cao (ft from their answer to (a))A1
- (b) Answer: 180
Question 12
- (a) 224 identifiedM1
- (a) 16777216 caoA1
- (a) Answer: 224 = 16777216 colours
- (b) more bits are needed to store the colour of each individual pixel oeB1
- (b) since the total file size is (bits per pixel x number of pixels), increasing the bits per pixel increases the total number of bits needed for the whole image oeB1
- (b) Answer: Each pixel needs more bits to store its colour, and since total file size = bits per pixel x number of pixels, increasing the bits per pixel increases the total size of the file.
Question 13
- inputs num1 and num2 and converts them to integers, e.g. using input() and int() oeB1
- calculates the total, e.g. total = num1 + num2 oeB1
- uses selection to compare total against 255, e.g. if total > 255 then ... else ... endif oeB1
- outputs an appropriate message for both the overflow branch and the no-overflow branch oeB1
- Answer:num1 = input("Enter the first number: ")
num2 = input("Enter the second number: ")
num1 = int(num1)
num2 = int(num2)
total = num1 + num2
if total > 255 thenprint("Overflow: the result cannot be stored in an 8-bit register")elseprint("No overflow. Result = " + str(total))endif
Question 14
- Level 1 Basic, isolated point(s) with little or no development, e.g. a simple unsupported statement that hexadecimal is shorter than binary. Answer may be a simple, undeveloped list.1-2
- Level 2 A reasonable discussion covering at least two relevant points (e.g. length, readability, conversion), with some development but limited linkage between ideas or minor inaccuracies.3-4
- Level 3 A detailed, coherent discussion covering multiple relevant points, clearly linked to why they matter for programmers (e.g. reduced transcription errors, quick conversion via nibbles), with logically structured reasoning throughout.5-6
- Indicative content:
- Hexadecimal numbers are much shorter/more compact than the equivalent binary number (e.g. an 8-bit binary number needs only 2 hex digits), making them quicker to read and write.
- Long strings of binary digits are difficult for humans to read accurately and are more likely to lead to transcription/typing errors; hexadecimal reduces this risk.
- Each hexadecimal digit corresponds exactly to a 4-bit nibble, so conversion between binary and hexadecimal is quick and does not require a calculator or long division.
- Hexadecimal is still closely related to the underlying binary representation (unlike denary), so it remains meaningful to programmers working with bit patterns, memory addresses and colour codes.
- Converting between denary and binary requires more complex division/remainder calculations and is less directly linked to the bit pattern actually stored by the computer.
- A balanced answer might note that hexadecimal is still less immediately meaningful to non-programmers than denary, so it is a trade-off between compactness/accuracy for programmers and general readability.
Question 15
- (a) binary split into nibbles 1010 and 1100M1
- (a) AC caoA1
- (a) Answer: AC
- (b) correct column addition attempted with carries shown/propagated correctlyM1
- (b) 100010001 cao (9-bit result)A1
- (b) overflow occurs, because a carry is generated out of the most significant (8th) bit / because the true total, 273, is greater than the maximum 8-bit value of 255 oeB1
- (b) Answer: 100010001; overflow occurs because the true sum, 273, is greater than 255, so a carry is generated out of the register's most significant bit
- (c) 00010001 stated (ft from their 9-bit answer to (b), dropping the leading bit)B1
- (c) 17 cao (ft from their binary answer)B1
- (c) Answer: 00010001 = 17
Mark your answers
Check answers without an account. Some answers can be checked automatically; use the mark scheme to mark the rest.