Binary Numbers FRQ Practice

Responses receive AI feedback against a rubric after submission. Scores are practice estimates.

Question 1 of 5

An unsigned integer uses exactly 8 bits. The bit pattern is 10010110.

Place 128 64 32 16 8 4 2 1
Bit 1 0 0 1 0 1 1 0

(a) Compute the decimal value. Show which place values you add. (b) Write the 8-bit pattern for one more than that decimal value. (c) Explain why showing place values is useful when converting.

Question 2 of 5

Convert decimal 43 to binary.

(a) Show repeated division by 2 or an equivalent place-value breakdown until you obtain the binary digits. (b) Write the result as an 8-bit pattern. (c) Verify by converting your 8-bit pattern back to decimal.

Question 3 of 5

A game scores points in an unsigned 5-bit field. The current score bits are 11101. The player earns 5 more points, and the sum is written back into the same 5-bit field.

(a) Convert 11101 to decimal. (b) Add 5 and state whether the exact sum fits in 5 unsigned bits. (c) If the hardware keeps only the low 5 bits of the sum, what decimal value is stored? Show the arithmetic.

Question 4 of 5

A lab stores brightness using 4 fractional bits after the binary point (weights 1/2, 1/4, 1/8, 1/16). The true brightness is 0.70 on a 0-to-1 scale.

(a) List the decimal values of those four fractional place weights. (b) Find a 4-bit fractional pattern whose value is as close as possible to 0.70 without going over 0.70. Show the sum. (c) Explain why 0.70 itself cannot be stored exactly with these bits (round-off).

Question 5 of 5

The bit sequence 00001100 is stored in memory.

(a) Interpret the sequence as an unsigned 8-bit integer and give its decimal value. (b) Describe one different abstraction the same bits could represent in another program (for example, a color channel or a character code), without inventing a contradictory numeric value. (c) Explain what this example shows about bits and meaning.