Unsigned binary integers

In the decimal number 202, the left-hand 2 has weight 100 and the right-hand 2 has weight 1. Which statement follows?

Multiply each digit by its own place weight

Binary uses two digits

A bit is one binary digit: 0 or 1. An unsigned binary representation stores a whole number from zero upwards, without a sign bit

The rightmost place has weight 1. Double the weight for each place to its left: 1, 2, 4, 8, 16 and so on

In four places, the weights from left to right are 8, 4, 2, 1. A digit 1 includes that weight; a digit 0 contributes zero

Binary 1010 has value 8 + 2 = 10 in decimal notation. The visible digits are a representation, not the decimal number one thousand and ten

Add the included weights

Use an unsigned 4-bit binary representation: each position contains 0 or 1, and there is no sign bit

What is the value in decimal notation? Enter a whole number

A digit 1 includes its place weight; a digit 0 contributes zero

Add the included weights: \(8 + 4 + 1 = 13\)

Read four bits

Start with digits 0101, whose value is 5. Predict the change if only the digit of weight 8 becomes 1, then test it. Try other digits and compare each change with its weight

Starting at 0101, what happens when only the weight-8 digit changes from 0 to 1?

Choose digits from left to right

To represent a decimal integer, start at the largest available weight. If it fits the amount left, write 1 and subtract it; otherwise write 0

Repeat for every smaller weight. For decimal 9 in four places, include 8, skip 4 and 2, then include 1: the result is 1001

Keep every required position. Zero is 0000 in four bits, not an empty response

Keep the unused positions

Use an unsigned 4-bit binary representation: each position contains 0 or 1, and there is no sign bit

The decimal integer to represent is 3

Write exactly 4 binary digits, keeping leading zeros when needed, with no spaces or base label

Start with 3 and consider the weights from largest to smallest

Use 1 when the weight fits the amount left, then subtract it; otherwise use 0

The 4 digits are 0011; check their weighted sum: \(2 + 1 = 3\)

Construct four bits

A field requires exactly four unsigned binary digits for decimal 3. Both 11 and 0011 have decimal value 3. Which response satisfies the field's requirement?

Check both value and number of digits

Eight bits make one byte

One byte contains eight bits. For an unsigned integer, their weights from left to right are 128, 64, 32, 16, 8, 4, 2, 1

Use the same weighted-sum method. Leading zeros preserve width without adding value

The meaning of a byte depends on the representation rule. These questions explicitly use unsigned integers; they do not use a signed-number or character encoding

Read a byte

Use an unsigned 8-bit binary representation: each position contains 0 or 1, and there is no sign bit

What is the value in decimal notation? Enter a whole number

A digit 1 includes its place weight; a digit 0 contributes zero

Add the included weights: \(128 + 32 + 2 = 162\)

Combine high and low weights

Construct a byte

Use an unsigned 8-bit binary representation: each position contains 0 or 1, and there is no sign bit

The decimal integer to represent is 42

Write exactly 8 binary digits, keeping leading zeros when needed, with no spaces or base label

Start with 42 and consider the weights from largest to smallest

Use 1 when the weight fits the amount left, then subtract it; otherwise use 0

The 8 digits are 00101010; check their weighted sum: \(32 + 8 + 2 = 42\)

Keep eight positions

Count zero as a possible value

With every bit 0, the unsigned value is 0. With every bit 1, the value is the sum of all the weights

Four bits have 16 patterns and represent the integers 0 through 15. Eight bits have 256 patterns and represent the integers 0 through 255

Each added bit doubles the number of patterns. The greatest unsigned value is one less than the pattern count because zero is included

An unsigned byte has eight weights: 128, 64, 32, 16, 8, 4, 2, 1. Which statement correctly distinguishes its greatest value from its number of patterns?

Add the weights, then include zero when counting values

Read the rule before the bits

For unsigned binary, add the weights whose digits are 1

To construct a representation, work from the largest weight down and keep every required position

One byte is eight bits. An unsigned byte has 256 possible patterns, representing 0 through 255

A later text, image or sound representation needs its own rule for interpreting the stored numbers