Binary Numbers

The idea of representing quantities with only two symbols predates modern computing by centuries. Long before transistors and silicon chips, mathematicians recognized that any number expressible in our familiar base-10 (decimal) system could equivalently be written in base-2 (binary) — a system requiring only the digits 0 and 1. This insight became the cornerstone of digital computing because electronic circuits naturally distinguish between two voltage states: high and low, on and off, true and false. The elegance of binary lies in its alignment with the physical properties of hardware: a single binary digit, or bit, maps directly to the smallest unit of information a machine can store.

The central question this lesson addresses is deceptively simple: how does a machine that recognizes only two electrical states represent the vast universe of numbers, text, images, and sound? The answer begins with understanding positional notation in base-2 and recognizing that every piece of digital data — from a single character to a streaming video — ultimately reduces to sequences of binary digits.

Binary is a positional number system — the value of each digit depends on its position within the number, just as in decimal. In decimal, positions correspond to powers of 10; in binary, positions correspond to powers of 2. Understanding this single structural parallel unlocks nearly every conversion and arithmetic operation you will need for the AP exam.

The place-value diagram above makes the conversion algorithm explicit. Starting from the leftmost bit (the most significant bit) and moving right to the least significant bit, you multiply each digit by the corresponding power of 2 and sum the products. Any position holding a 0 contributes zero to the total, so only the 1-bits matter. This direct mapping between bit position and power of 2 is the conceptual key to every binary-to-decimal conversion.

Binary arithmetic follows the same rules as decimal arithmetic, with a simpler addition table: 0 + 0 = 0, 0 + 1 = 1, 1 + 0 = 1, and 1 + 1 = 10 (i.e., 0 with a carry of 1). When carries cascade—as in 1111 + 0001—every bit position generates a carry, and the result overflows if there are not enough bits to hold the final carry. Recognizing overflow conditions is an important exam skill: adding two n-bit numbers can produce a result requiring n + 1 bits.

The repeated-division algorithm is systematic and mechanical, but for numbers that are close to powers of 2 or that you can decompose by inspection, a subtraction method is often faster. Start with the largest power of 2 that does not exceed the target, place a 1 in that position, subtract, and repeat with the remainder. For example, 200 = 128 + 64 + 8, so 200₁₀ = 11001000₂. Both approaches yield the same result; familiarity with both lets you choose the quicker path on a timed exam.

Unsigned binary numbers, which represent only non-negative integers, are the foundation upon which more sophisticated data representations are built. The AP CSP curriculum expects you to recognize that binary encoding extends far beyond simple counting. Numbers with fractional parts, negative numbers, characters, colors, and audio samples all rely on agreed-upon abstractions layered on top of binary sequences.

The overarching principle is that binary alone does not inherently mean anything — meaning arises from the abstraction layer that interprets the bits. The same 8-bit sequence 01000001 could represent the unsigned integer 65, the ASCII character 'A', or part of a pixel's color, depending on context. This idea — that data requires agreed-upon encoding schemes to be meaningful — is a recurring theme throughout AP Computer Science Principles.