Crux Read bit patterns, ASCII bytes, a boolean expression, and a half-adder trace, then predict the result the way the unit taught you to.
Your altitude — climbing toward senior
ZeroJuniorMiddleSenior
You are at middle altitude — in the sky
◷ 14 min
The unit was about reading meaning out of bits. Here you do it directly: decode a binary number, decode an ASCII byte, evaluate a boolean expression by precedence, and trace a half-adder. Work each one out before you pick.
Goal
Practise the core loop of the whole unit — take a raw pattern or a small circuit, apply the rule (place value, an encoding, boolean precedence, or a gate’s truth table), and read off the correct result.
Snippet 1 — read the binary number
bit: 1 0 1 1 0 1 0 0weight: 128 64 32 16 8 4 2 1
Quiz
Completed
Reading this 8-bit pattern by place value, what decimal number is it?
Heads-up The weight-1 position is the rightmost bit, not the leftmost. Anchor weight 1 on the right and double leftward, then sum the 1-positions: 128 + 32 + 16 + 4 = 180.
Heads-up 11010100 is the binary representation; the question asks for its decimal value. Summing the weights of the 1-bits gives 180.
Heads-up The count of bits is the width, not the value. The value is the place-value sum of the 1-bits: 128 + 32 + 16 + 4 = 180.
Decoded as ASCII text, what do these two bytes spell — and what would the SAME two bytes be under a plain numeric reading?
Heads-up Bytes carry no inherent meaning. Numerically these bytes are 72 and 105; only the ASCII encoding turns them into 'Hi'.
Heads-up ASCII does have lowercase: 'a'=97, 'i'=105. Byte 105 is lowercase 'i', so the text is 'Hi', not 'HI'.
Heads-up ASCII is a 7-bit code stored in 8-bit bytes with the high bit zero. Both bytes are in range 0–127, so they decode fine: 'Hi'.
Snippet 3 — evaluate the boolean expression
expr = NOT A OR (B AND C)inputs: A = 1, B = 1, C = 0precedence: NOT first, then AND, then OR
Quiz
Completed
Evaluating by the stated precedence, what is the result?
Heads-up Precedence is NOT, then AND, then OR — not strict left to right. The parenthesised AND binds B and C first: NOT A (=0) OR (B AND C = 0) = 0.
Heads-up NOT binds tightest and applies only to A, giving NOT A = 0. It does not negate the entire expression. Result is 0.
Heads-up Mixing is fine; precedence resolves it. NOT, then AND, then OR yields a single value: here 0.
Snippet 4 — trace the half-adder
half-adder: sum = A XOR B (1 only when inputs differ) carry = A AND B (1 only when both are 1)inputs: A = 1, B = 1
Quiz
Completed
What sum and carry does the half-adder produce for A=1, B=1, and why does that match adding the bits?
Heads-up The sum bit is the XOR, which is 0 when inputs are equal. 1 + 1 is binary 10: sum bit 0, carry bit 1 — not sum 1.
Heads-up XOR is 1 only when inputs DIFFER. For two 1s, XOR is 0. So sum = 0 and the carry (AND) is 1.
Heads-up AND of two 1s is 1, so the carry is 1, not 0. Only the XOR sum is 0 here.
Recap
Every snippet was the unit’s reading loop in miniature: a binary number is the place-value sum of its 1-bits; an ASCII byte is a number until an encoding names it a letter; a boolean expression resolves by NOT-then-AND-then-OR; and a half-adder’s XOR-sum and AND-carry reproduce single-bit addition exactly. Bits plus a rule give meaning — that is the entire unit in four reads.