Skip to topic
    ← Back to course topics

    Binary — Edexcel GCSE Computer Science

    Test yourself on Binary with PEARSON EDEXCEL GCSE practice questions.

    Start free

    7 days Premium · Then free forever · No card, no charge

    Binary explained

    This topic covers the fundamental use of binary within computer systems to represent various data types, including numbers, text, sound, and graphics.

    Read the full explanation

    It encompasses binary arithmetic, the representation of signed and unsigned integers, the use of hexadecimal notation, and the implications of bit constraints such as overflow.

    Read the Binary study guideFull revision notes for Edexcel GCSE Computer Science

    What to demonstrate

    1. Conversion between denary and 8-bit binary numbers
    2. Addition of two positive binary patterns
    3. Application of logical and arithmetic binary shifts
    Show all 6 objectives
    1. Identification of overflow in binary storage
    2. Conversion between hexadecimal and binary
    3. Determination of the maximum number of states for a given binary pattern length

    Binary exam tips

    Topic Overview

    Binary is the foundation of all modern computing, representing data using only two digits: 0 and 1. In the Edexcel GCSE Computer Science syllabus, you'll learn how binary is used to represent numbers, text, images, and sound inside a computer. Understanding binary is essential because every operation a computer performs—from simple arithmetic to running complex software—relies on binary logic at the hardware level.

    This topic covers converting between binary and denary (decimal), binary addition, and binary shifts. You'll also explore how characters are encoded using ASCII and Unicode, how images are represented as bitmaps, and how sound is sampled into binary. Mastering binary gives you insight into how data is stored, processed, and transmitted, which is crucial for topics like data representation, computer architecture, and networking.

    Binary fits into the wider subject as a core concept in data representation. It links directly to hexadecimal (often used as a shorthand for binary), logic gates, and machine code instructions. By the end of this topic, you should be able to perform conversions, explain why binary is used, and describe how different data types are encoded.

    Key Concepts
    • →Binary digits (bits) are the smallest unit of data; 8 bits make a byte.
    • →Place value in binary: each column represents a power of 2 (1, 2, 4, 8, 16, etc.).
    • →Converting between binary and denary: multiply each bit by its place value and sum.
    • →Binary addition: follow rules (0+0=0, 0+1=1, 1+1=0 carry 1, 1+1+1=1 carry 1).
    • →Binary shifts: shifting left multiplies by 2; shifting right divides by 2 (integer division).
    Marking Points
    • Conversion between denary and 8-bit binary numbers
    • Addition of two positive binary patterns
    • Application of logical and arithmetic binary shifts
    • Identification of overflow in binary storage
    • Conversion between hexadecimal and binary
    • Determination of the maximum number of states for a given binary pattern length
    Examiner Tips
    • 💡Ensure you can perform binary addition without a calculator
    • 💡Practice converting between binary and hexadecimal fluently as this is a common exam task
    • 💡Always check if an addition results in an overflow beyond the 8-bit limit
    • 💡Remember that two's complement is used for signed integers
    • 💡Always show your working in conversion questions—write the place values above the bits to avoid mistakes and to gain method marks even if the final answer is wrong.
    • 💡For binary addition, check for carries carefully; a common error is forgetting to carry the 1 when adding three 1s. Practice with a few examples to build confidence.
    • 💡When explaining why computers use binary, mention reliability (only two states, less prone to error) and simplicity (easy to implement with transistors). Avoid vague answers like 'it's easier'.
    Common Mistakes
    • Confusing logical and arithmetic shifts
    • Failing to account for overflow when adding binary numbers
    • Incorrectly converting between denary and two's complement signed integers
    • Miscalculating the number of states for a given bit length
    • Misconception: Binary numbers are read from left to right like denary. Correction: The leftmost bit has the highest place value (most significant bit), so you must start from the left when converting.
    • Misconception: Binary addition always results in a fixed number of bits. Correction: Addition can cause overflow if the result exceeds the available bits; you may need an extra bit to represent the sum correctly.
    • Misconception: All computers use the same binary representation for text. Correction: Different character sets exist (ASCII, Unicode); ASCII uses 7 or 8 bits, while Unicode uses more bits to support many languages.
    Frequently Asked Questions
    How do I convert binary to denary quickly?
    Write the binary digits above powers of 2 starting from the rightmost bit (2^0). For each bit that is 1, add the corresponding power of 2. For example, 1101 = 8 + 4 + 0 + 1 = 13. Practice with small numbers first, then move to 8-bit numbers.
    Why do computers use binary instead of decimal?
    Computers use binary because electronic circuits have two stable states: on (1) and off (0). This makes binary reliable and simple to implement with transistors. Decimal would require ten different voltage levels, which is harder to distinguish and more prone to errors.
    What is the difference between ASCII and Unicode?
    ASCII uses 7 or 8 bits to represent 128 or 256 characters, mainly English letters and symbols. Unicode uses up to 32 bits to represent over a million characters from many languages, including emojis. Unicode is backward-compatible with ASCII.
    How does binary represent images?
    Images are represented as a grid of pixels. Each pixel's colour is stored as a binary number. For a black-and-white image, 1 bit per pixel is enough (0=white, 1=black). For colour images, more bits per pixel are used (e.g., 24 bits for true colour).
    What is a binary shift and how does it work?
    A binary shift moves all bits left or right by a certain number of places. A left shift multiplies the number by 2 for each shift (e.g., 0011 (3) shifted left once becomes 0110 (6)). A right shift divides by 2 (integer division), discarding any remainder. Bits that fall off the end are lost.
    How do I add binary numbers with carries?
    Add bits column by column from right to left. Use these rules: 0+0=0, 0+1=1, 1+1=0 carry 1, 1+1+1=1 carry 1. For example, adding 1011 (11) and 1101 (13): start from rightmost: 1+1=0 carry 1; next column: 1+0+carry1=0 carry1; next: 0+1+carry1=0 carry1; leftmost: 1+1+carry1=1 carry1, so result is 11000 (24).