Why does the binary pattern 11111111 sometimes mean 255 and sometimes mean −1? Because bits are symbols, and their meaning depends on the chosen representation. Computers store patterns of zeros and ones, while humans interpret those patterns as positive numbers, signed numbers or characters. A Computing student should always identify the encoding, the number of bits and the intended type before translating a value.
This independent Ministry of Education V3.0 reference develops Singapore’s 2027 G3 Computing K349 Data Representation outcomes. The chapter teaches binary, denary and hexadecimal conversion; place values; fixed-width two’s complement for positive and negative integers; detecting representational limits; 8-bit extended ASCII as a text-encoding example; and clear verification habits. It includes twenty-six original worked examples, a twelve-stage Width–Place–Interpret protocol and eduKate Depth–Load–Transfer diagnostics.
All data packets, memory examples and messages in this chapter are invented. This is not an official MOE or SEAB examination, cybersecurity specification or programming standard. Signed and unsigned interpretations depend on the declared representation; do not assign one definite value to a bit pattern without knowing its context.
1. Bits Store Patterns, Not Meaning Automatically
One bit can take a binary value of zero or one. Eight bits make a byte. A sequence of bits does not declare whether it represents a number, a character or another data object. An unsigned 8-bit integer can represent values 0 to 255; a signed 8-bit two’s-complement integer represents −128 to 127. Both can use exactly the same eight physical bits.
2. The Official 2027 G3 Computing K349 Scope
The official K349 G3 Computing syllabus, Module 1.2 Data Representation, includes positive whole-number binary representation, conversions among binary, denary and hexadecimal, fixed-width two’s complement for signed whole numbers, and an example of 8-bit extended ASCII representing English text. This is a defined slice of Computing Fundamentals. Detailed IEEE floating-point representation, compression algorithms and complete Unicode internals are not listed as Module 1.2 learning outcomes; they can be optional enrichment rather than compulsory expectations.
3. Binary Is a Base-Two Positional System
From right to left, binary digit positions represent 1, 2, 4, 8, 16, 32, 64, 128 and larger powers of two. For example 10110₂ means 16+4+2=22 in denary. Leading zeroes do not change an unsigned value, but they can show the bit width that matters in signed representation.
4. Hexadecimal Groups Four Binary Digits
Hexadecimal uses sixteen digit symbols: 0 through 9, then A for ten, B for eleven, C for twelve, D for thirteen, E for fourteen and F for fifteen. Four bits represent exactly sixteen patterns, so each binary nibble corresponds to one hexadecimal digit. For example 1010₂=A₁₆ and 1111₂=F₁₆.
5. A Fixed Width Changes Signed Interpretation
Two’s complement is a representation of signed integers within a fixed number of bits. For n bits, the usual range is −2^(n−1) to 2^(n−1)−1. In eight bits that is −128 to 127. The leftmost bit has a negative place value in the signed interpretation; this is different from treating it as an unsigned 128 place.
6. Character Encodings Need a Mapping
Text encoding maps character symbols to numeric codes and then to bit patterns. A familiar example is uppercase A, with decimal code 65, represented as 01000001 in an eight-bit byte preserving the common ASCII mapping. ‘Extended ASCII’ has historically referred to different eight-bit code-page mappings for characters above 127, so do not claim there is one universal mapping for every accented or special character.
7. Eight Rooms of Data-Representation Reasoning
Room one identifies a data type. Room two fixes base and width. Room three calculates unsigned place values. Room four groups bits into hexadecimal nibbles. Room five applies signed two’s-complement interpretation when specified. Room six checks ranges and overflow. Room seven uses a declared character table for text. Room eight verifies the answer in a new representation without changing the original bits.
8. Twelve-Stage Width–Place–Interpret Protocol
Stage 1 — Read the base and width
Look for a binary suffix, hexadecimal notation, a stated denary value, or an 8-bit signed label. An eight-digit pattern must not be assumed unsigned if the question explicitly asks for two’s complement.
Stage 2 — Separate the physical pattern from its interpretation
Write the digits as given before deciding their value. The same byte can represent 255 unsigned and −1 signed in two’s complement.
Stage 3 — Label binary place values
Starting at the rightmost bit, place 1,2,4,8,16 and further powers of two above columns. Only positions containing 1 contribute to the unsigned total.
Stage 4 — Convert denary to binary methodically
Repeatedly divide a nonnegative integer by two, record remainders and read from bottom to top, or subtract powers of two. Reconvert to check.
Stage 5 — Create four-bit groups for hexadecimal
Group a binary string from the right into blocks of four and pad on the left with zeroes if needed for unsigned conversion. Each block maps to one hex digit.
Stage 6 — Decode hexadecimal place values
For a two-digit hex value XY, calculate 16×value(X)+value(Y). For B6, B is eleven, giving 11×16+6=182.
Stage 7 — Establish signed range
Before writing a negative value in n-bit two’s complement, check whether it fits from −2^(n−1) through 2^(n−1)−1.
Stage 8 — Encode a negative two’s-complement number
Write the positive magnitude as n bits, invert each bit and add one within that width. Explain that the width is fixed rather than indefinitely extending the written result.
Stage 9 — Decode a negative signed pattern
If its leading bit is one under n-bit two’s complement, interpret using the negative highest-place weight or invert-and-add-one to recover the magnitude.
Stage 10 — Check arithmetic limits
When an operation exceeds the declared signed range, the stored n-bit result may not represent the mathematical sum. Recognise overflow rather than confidently reporting the wrapped pattern as the true result.
Stage 11 — Interpret text using the stated table
For an ASCII-based exercise, read the numeric code and character using the specified encoding. A binary byte representing a character should not be treated as an arbitrary signed integer at the same time.
Stage 12 — Reverse the conversion independently
Convert the answer back to its starting system and check its width, sign and code. Repeat with a different bit pattern without using the previous worked example as a template.
9. Original Fictional Case: The School Library Reader
Imagine a fictional library device storing a sensor count as one unsigned byte, a temperature change as one signed eight-bit two’s-complement byte and a letter as one eight-bit character code. All three records contain eight bits, yet their meanings differ. A count byte 11111111₂ means 255; a signed reading 11111111₂ means −1; and the character byte 01000001₂ can mean uppercase A under the common ASCII mapping. A computer system must know which field is which.
Suppose the sensor records 10110110₂ in an unsigned count field. This equals 128+32+16+4+2=182, or B6₁₆. A signed temperature-change field 11101110₂ equals −18 in two’s complement. Both patterns are legitimate; the distinction comes from the field definition. This is why a labelled data specification matters as much as the arithmetic.
10. Twenty-Six Worked Binary and Encoding Examples
11. Worked Example A — Convert four binary bits
1010₂ equals 8+2=10₁₀. The positions containing zero add nothing. Writing 1+0+1+0 would treat a positional numeral as if it were ordinary digit addition.
12. Worked Example B — Convert six binary bits
101101₂ equals 32+8+4+1=45₁₀. Check each one-bit’s power: from the right 1,4,8 and 32.
13. Worked Example C — Convert 22 to binary
22=16+4+2, so 10110₂. Reversing gives 16+4+2=22, confirming the representation.
14. Worked Example D — Convert 64 to binary
64=2⁶, so it is 1000000₂, one followed by six zeroes. The leftmost one is in the 64 position.
15. Worked Example E — An eight-bit unsigned maximum
11111111₂ as an unsigned byte equals 128+64+32+16+8+4+2+1=255. A single byte has 256 possible unsigned combinations including zero.
16. Worked Example F — The zero byte
00000000₂ is unsigned zero and signed two’s-complement zero. The leading zeroes communicate width even though they do not change the numerical value.
17. Worked Example G — One nibble to hex
1110₂ maps to E₁₆ because 8+4+2=14. Hex digits A–F stand for decimal ten through fifteen, not arbitrary letter labels.
18. Worked Example H — Two nibbles to hex
11010101₂ groups as 1101 0101 and becomes D5₁₆. Decoding D5 gives 13×16+5=213.
19. Worked Example I — Convert B6 hex to denary
B6₁₆ equals 11×16+6=182₁₀. A student who reads the two characters as ‘116’ ignores base sixteen.
20. Worked Example J — Convert 255 to hex
255=15×16+15, so the hex result is FF₁₆. The matching binary byte is 11111111₂.
21. Worked Example K — Convert 2A hex to binary
2A₁₆ becomes 0010 1010₂. The left nibble 2 is 0010 and the right nibble A is 1010; the unsigned decimal value is 42.
22. Worked Example L — Pad bits before grouping
Binary 10110₂ becomes 0001 0110 for hex grouping, yielding 16₁₆. Adding leftmost zeroes for an unsigned conversion does not change the value.
23. Worked Example M — Signed eight-bit positive range
01111111₂ in eight-bit two’s complement is +127, the greatest positive value. Its leading zero distinguishes it from negative codes in this representation.
24. Worked Example N — Eight-bit negative one
11111111₂ in signed eight-bit two’s complement represents −1. The same bits represent 255 if the field is explicitly unsigned.
25. Worked Example O — Encode negative five
Start with +5 as 00000101, invert to 11111010, add one to reach 11111011₂, the eight-bit two’s-complement pattern for −5.
26. Worked Example P — Encode negative eighteen
+18 is 00010010, inverted gives 11101101 and adding one gives 11101110₂. Decode using the signed high place to verify −18.
27. Worked Example Q — Decode 11110110
With an eight-bit signed representation, invert 11110110 to 00001001 then add one to 00001010=10. Therefore the original represents −10.
28. Worked Example R — Decode using negative place weight
10000101₂ in eight-bit two’s complement equals −128+4+1=−123. This method avoids extra inversion when the columns are labelled.
29. Worked Example S — The lowest eight-bit signed value
10000000₂ represents −128 in eight-bit two’s complement. Positive +128 does not fit in that same signed eight-bit range.
30. Worked Example T — One-byte overflow
The mathematical sum 127+1 is 128, but +128 cannot be represented in signed eight-bit two’s complement. The wrapped bits 10000000 would be interpreted as −128; recognise overflow rather than treating the representation as correct arithmetic.
31. Worked Example U — Width changes interpretation
11111111₂ in eight-bit two’s complement is −1. As a nine-bit positive number, 011111111₂ is +255. Every signed interpretation must state the complete chosen width.
32. Worked Example V — Binary place-value comparison
10000000₂ is 128 unsigned, whereas 01111111₂ is 127 unsigned. In signed eight-bit two’s complement, the first is −128 and the second +127. The same comparison can reverse when the type changes.
33. Worked Example W — Character A as an 8-bit byte
In a common ASCII-compatible eight-bit mapping, uppercase A has decimal code 65, represented 01000001₂. The bit pattern is not the letter shape itself; it identifies the character through a code table.
34. Worked Example X — Character B and a one-step code shift
Uppercase B commonly has code 66, 01000010₂. Its code follows A’s 65 in the standard mapping. This does not mean all languages’ letters are stored by simple consecutive codes.
35. Worked Example Y — Character ‘0’ versus numeric zero
The character ‘0’ in the ASCII mapping has decimal code 48 (00110000₂), whereas numeric zero as an unsigned byte is 00000000₂. Character content and numeric value are different interpretations.
36. Worked Example Z — A mixed record
A hypothetical data record stores unsigned count 00001010, signed change 11111101 and character 01000001. These mean 10, −3 and A respectively under the declared fields. Interpreting all three as positive counts would be incorrect.
37. Why Hexadecimal Is Useful to Humans
Binary is precise but long. Grouping four bits into one hex digit shortens a display while preserving the exact pattern. A two-digit hex value such as A3 maps directly to 1010 0011. This is a convenient notation for examining machine data, not an alternative physical storage medium.
38. Two’s Complement Requires Width
An isolated notation like 1111₂ cannot be called −1 without a declared signed width. As four-bit two’s complement it is −1, but as an unsigned value it is 15, and as part of a wider byte it may carry a different sign or magnitude. Width is not decoration.
39. A Leading One Does Not Always Mean Negative
The leading one indicates a negative value only under the chosen signed two’s-complement interpretation. For an unsigned value 10000000₂ is 128. Asking what a pattern means without the type is like asking the value of a written date without knowing its format.
40. Negative Zero Is Not a Second Code Here
Two’s-complement integer representation has a single zero pattern. In eight bits, 00000000 represents zero; applying invert-and-add-one to zero returns zero after fixed-width wrap. Students should not invent a second negative-zero code in the same representation.
41. The Range Formula Is a Reasoning Tool
For n-bit two’s complement, one bit effectively handles the sign and the range is −2^(n−1) to +2^(n−1)−1. A six-bit signed representation covers −32 through +31. This explains why an eight-bit code can store −128 but not +128. Verify the range before attempting an encoding.
42. Hexadecimal Digits Are Not Decimal Teenagers
Hex digits A through F represent ten to fifteen as single digit values. In B6, the B contributes eleven sixteens, not the letter B or a decimal 11 in a separate number. Positional weights change with base, but the idea of a digit times its place value does not.
43. Encoding Depends on a Shared Convention
A byte pattern cannot communicate a character unless sender and receiver share a code mapping. Common ASCII-compatible codes for English letters are familiar, but the values above 127 in eight-bit extended code pages are not uniquely standardised across every implementation. Treat the question’s given table as the authority.
44. Representation Is Not the Same as Display
A computer may store the numeric value 65 in a byte, display the characters ’65’ using two character codes, or display the letter A using one code. These outputs are distinct representations. A clear answer names which data type and presentation are being discussed.
45. Memory Units Need a Separate Unit Check
One byte is eight bits. A kilobyte in decimal SI usage is 1000 bytes, while a kibibyte is 1024 bytes. The K349 Computer Architecture outcome explicitly distinguishes these units. Do not confuse binary number conversion with the different question of storage-capacity units.
46. A Correct Table Needs Reversibility
If a student claims a hex representation, converting it back into grouped bits should reproduce the original pattern after any appropriate leading-zero padding. If a signed value is claimed, invert and add one to confirm its negative magnitude. Bidirectional checks catch positional mistakes.
47. Fixed-Width Overflow Is Not a Calculation Error to Hide
A signed eight-bit computation yielding a mathematical result beyond 127 or below −128 exceeds its representation. If stored bits wrap, that does not prove the original arithmetic result changed. Students should identify an overflow condition rather than silently interpreting the wrapped result as a true sum.
48. Information and Ethics Connect but Are Distinct
Bit patterns can encode names, measurements and identifiers. Their confidentiality or lawful use depends on systems, permissions and governance rather than the choice of binary versus hexadecimal display. Data representation is foundational Computing knowledge; privacy and security require additional reasoning.
49. Misconception Ledger
Error: every binary number is positive. Repair: identify signed representation. Error: leftmost one always means negative. Repair: read type. Error: 1 KB equals 1 KiB. Repair: distinguish 1000 from 1024 bytes. Error: 11111111 always means 255. Repair: compare unsigned and signed. Error: character ‘0’ equals numeric byte zero. Repair: distinguish text encoding from numerical storage.
50. Three-Pupil Bit-Pattern Workshop
Student A converts among binary, denary and hex; student B encodes signed eight-bit numbers and checks range; student C decodes a short character record and challenges the data-type declaration. The tutor rotates tasks and asks each learner to justify one conversion independently before moving on.
51. eduKate Depth–Load–Transfer Diagnostic
Depth: can a pupil explain why the same pattern has different signed and unsigned interpretations? Load: can they track width, place values, negative encoding and character mapping in one record? Transfer: can they decode a different unfamiliar mixed record accurately? The Clementi small-group teaching reference supplies the diagnose–repair–practise–independent-transfer method.
52. Parent and Tutor Questions
Ask ‘How many bits?’, ‘Which base?’, ‘Is this signed?’, ‘What is the highest place value?’, ‘Can you convert back?’, and ‘Is this meant to be a character?’ A correct result without a declared representation may simply be a lucky guess.
53. Frequently Asked Questions
What is the difference between a bit and a byte?
A bit is one binary digit, while a byte contains eight bits.
Why use hexadecimal?
One hex digit represents four bits, making long binary patterns easier to read without changing their exact information.
Is 11111111 equal to 255 or −1?
Both are valid under different declared eight-bit interpretations: 255 unsigned and −1 signed two’s complement.
How do I encode a negative number?
Fix the width, check its range, write the positive magnitude, invert the bits and add one.
What is the eight-bit two’s-complement range?
−128 to +127.
Can +128 fit in signed eight bits?
No. The largest positive signed eight-bit two’s-complement integer is 127.
Does ASCII store letters as drawings?
No. An encoding associates a numeric code with a character, and that code is represented using bits.
Is extended ASCII one universal table?
There are different eight-bit extended ASCII code-page conventions. Use the mapping specified by the exercise.
54. Independent Depth and Transfer Practice
Exercise 1 — Base conversion
Convert 11001101₂ to decimal: 128+64+8+4+1=205. Group into 1100 1101 to obtain CD₁₆.
Exercise 2 — Reverse hexadecimal
Convert 7B₁₆ to binary 0111 1011₂ and to denary 7×16+11=123.
Exercise 3 — Encode signed negative seven
Write 7 as 00000111, invert to 11111000 and add one to obtain 11111001₂ for −7.
Exercise 4 — Decode a signed byte
Decode 11101100₂ by inverse-and-add-one to magnitude 20, giving −20.
Exercise 5 — Spot overflow
Explain why +100 and +50 cannot both be added and stored as +150 in signed eight-bit two’s complement.
Exercise 6 — Mixed-record transfer
A record contains fields 11110000 unsigned, 11110000 signed and 01000010 text. Decode 240, −16 and B under the declared conventions.
55. Closing Principle
Bits carry patterns; their meanings come from bases, widths, signed representations and agreed character codes. Always define the format, perform a place-value calculation, check ranges and convert back to verify. Mastery means successfully reading a mixed record that is new to the learner.
Related eduKateSG References and Official Sources
Connect this chapter to Reference 203 — Computing Logic and Debugging, Reference 209 — Mathematical Powers, the MOE V3.0 Reference Library and the immutable Clementi teaching standard. Official curriculum: SEAB 2027 G3 Computing K349 Module 1.2 Data Representation.
MOE V3.0 Reference Sequence Navigation
Read Reference 300 and browse the MOE V3.0 Reference Library.