Login / Register
Follow Us
0
0
Register Free!
Register Free!
Online Mock Tests & Exam Preparation | Target Exams
Select Medium / माध्यम चुनें:
Eng (English) Hindi (हिन्दी)
CBSE • Class XI • Computer Science • Ch 2
Estimated Time: 45 Mins
Study Progress: In Progress

Encoding Schemes and Number System

In CBSE Class 11 Computer Science, "Encoding Schemes and Number System" provides a mathematically rigorous master study resource on digital data representation. This chapter covers positional number systems (Binary, Octal, Decimal, Hexadecimal), complete inter-base conversions, fractional conversions, signed binary representations (Sign-Magnitude, 1's Complement, 2's Complement arithmetic), and character encoding standards including standard ASCII, 8-bit Extended ASCII, Indian Script Code for Information Interchange (ISCII), and Universal Character Set (Unicode UTF-8, UTF-16, UTF-32) aligned with the 2026–27 CBSE curriculum.

Take Chapter CBT Test View All Chapters
Overview Core Concepts Syntax & Core Commands Summary Self Check Take MCQ Test

How Does a Microchip Differentiate Between the Number 65, the Letter "A", and the Color Blue?

Inside a digital microprocessor, there are no alphabets, no colors, and no musical notes. There are only trillions of microscopic semiconductor channels switching between high voltage (typically +1.2V to +3.3V, interpreted as logical 1) and low ground voltage (0V, interpreted as logical 0). When you press the letter "A" on your keyboard, the computer sees the binary string `01000001`. If interpreted as an unsigned integer, `01000001` equals the decimal number 65. If interpreted as a pixel component in an image file, it represents a specific shade of dark grey. How do digital systems encode human languages, fractions, signed negative numbers, and emojis into sequences of pure voltage states without ambiguity? This chapter demystifies the mathematical foundations of digital data representation.

Why This Chapter Matters

Number systems and character encoding schemes are the bedrock of low-level software engineering, cybersecurity, cryptography, computer graphics, and network communications. When an engineer debugs a memory core dump, analyzes network packet headers in Wireshark, configures IP subnet masks, or writes high-performance bitwise algorithms in Python or C, they are interacting directly with hexadecimal and binary representations. Furthermore, understanding UTF-8 encoding prevents the dreaded "Mojibake" (garbled text) errors in multi-lingual web applications handling Hindi, Japanese, and international scripts.

Before You Begin (Prerequisites)

  • Elementary place value concepts in decimal arithmetic ($10^0, 10^1, 10^2$).
  • Basic arithmetic operations: integer division, remainders (modulo), and multiplication.
  • Conceptual understanding that digital hardware operates using discrete binary voltage states.

What You Will Learn (Core Objectives)

  • Master base conversions among Decimal (Base 10), Binary (Base 2), Octal (Base 8), and Hexadecimal (Base 16).
  • Convert fractional binary numbers to decimal and fractional decimal numbers to binary using successive multiplication.
  • Perform binary arithmetic: binary addition, binary subtraction, and overflow detection.
  • Analyze signed binary representation schemes: Sign-Magnitude, 1's Complement, and 2's Complement.
  • Explain character encoding standards: 7-bit ASCII, 8-bit Extended ASCII, 8-bit ISCII, and Unicode.
  • Differentiate between UTF-8, UTF-16, and UTF-32 in terms of byte length and variable-width encoding efficiency.

Chapter Roadmap & Progression

1 1. Positional Number Systems: Binar...
2 2. Systematic Base Conversion Algor...
3 3. Signed Integer Representation &...
4 4. Character Encoding Schemes: ASCI...

Complete Concept Guide (100% Curriculum Coverage)

1. Positional Number Systems: Binary, Octal, Decimal & Hexadecimal

Understand

In a positional number system, the value of any digit depends on three parameters: (1) the digit itself, (2) the position/place of the digit within the number, and (3) the base or radix ($r$) of the number system.

A general number with integer and fractional parts is formally expressed as:

$$N_r = (d_n d_{n-1} \dots d_1 d_0 . d_{-1} d_{-2} \dots d_{-m})_r = \sum_{i=-m}^{n} d_i \cdot r^i$$
SystemRadix ($r$)Allowed SymbolsBit Weight Sequence ($r^3, r^2, r^1, r^0 . r^{-1}$)Primary Purpose
Binary2$0, 1$$8, 4, 2, 1 . 0.5, 0.25$Native hardware architecture (transistors)
Octal8$0, 1, 2, 3, 4, 5, 6, 7$$512, 64, 8, 1 . 0.125$Compact shorthand for 3-bit binary groups
Decimal10$0, 1, 2, 3, 4, 5, 6, 7, 8, 9$$1000, 100, 10, 1 . 0.1$Human arithmetic and scientific counting
Hexadecimal16$0-9, \text{A}(10), \text{B}(11), \text{C}(12), \text{D}(13), \text{E}(14), \text{F}(15)$$4096, 256, 16, 1 . 0.0625$Memory address notation, color codes, byte dump

2. Systematic Base Conversion Algorithms

Understand & Algorithm
A. Decimal to Any Base ($r$) Conversion
  • Integer Part (Successive Division): Divide the decimal integer repeatedly by base $r$, recording remainders at each step until the quotient becomes 0. The result is read from bottom to top (Most Significant Bit to Least Significant Bit).
  • Fractional Part (Successive Multiplication): Multiply the fractional component by base $r$. The integer part of the product forms the next fractional digit. Repeat with the remaining fractional part until the fraction reaches 0 or desired precision. Read top to bottom.
B. Binary ↔ Octal & Hexadecimal Direct Grouping

Because $8 = 2^3$ and $16 = 2^4$, conversions between Binary and Octal/Hexadecimal require no arithmetic division—only bit grouping:

  • Binary to Octal: Group bits into sets of 3 starting from the binary point moving left for integers (pad left with 0s if needed) and moving right for fractions (pad right with 0s). Convert each 3-bit group to its octal digit.
  • Binary to Hexadecimal: Group bits into sets of 4 (nibbles) starting from the binary point. Convert each 4-bit group to its hexadecimal digit ($0-\text{F}$).
  • Example: Convert $(1101011011.1011)_2$ to Hexadecimal:
    • Integer: `0011 0101 1011` → `3 5 B`
    • Fraction: `1011` → `B`
    • Result: $(35\text{B}.\text{B})_{16}$

3. Signed Integer Representation & 2's Complement Arithmetic

Understand

In digital electronics, negative numbers cannot be represented by a literal minus sign. Three standard binary conventions exist for $n$-bit signed integers:

  1. Sign-Magnitude Representation: The most significant bit (MSB) acts as the sign bit ($0 = \text{positive}, 1 = \text{negative}$), while the remaining $n-1$ bits store the magnitude.
    • Flaw: Produces dual representations of zero ($+0 = 0000_2$ and $-0 = 1000_2$), complicating hardware ALU design.
  2. 1's Complement Representation: Positive numbers are written in standard binary. Negative numbers are formed by inverting every bit ($0 \to 1, 1 \to 0$).
    • Flaw: Still possesses dual zero representations ($0000_2$ and $1111_2$).
  3. 2's Complement Representation (Universal Standard): Positive numbers are written in standard binary. A negative number is formed by finding the 1's complement and adding 1 to the least significant bit: $$\text{2's Complement}(X) = \text{1's Complement}(X) + 1$$
    • Advantage: Possesses a single unique zero ($00000000_2$).
    • Range for $n$ bits: $[-2^{n-1} \text{ to } +2^{n-1} - 1]$. For an 8-bit byte: $-128 \text{ to } +127$.
    • Unified Hardware: Subtraction $A - B$ is performed as addition: $A + (\text{2's comp of } B)$, allowing the ALU to use identical adder circuits for both addition and subtraction!

4. Character Encoding Schemes: ASCII, ISCII & Unicode Standards

Understand

To store human language characters, symbols, and punctuation in computer memory, each character must be assigned a unique numeric code point:

StandardBit WidthTotal Code PointsScope & Characteristics
Standard ASCII7 bits$2^7 = 128$Encodes English alphabet ($A-Z: 65-90, a-z: 97-122$), digits ($0-9: 48-57$), punctuation, and control codes ($0-31$).
Extended ASCII8 bits$2^8 = 256$First 128 match ASCII; remaining 128 codes store Western European accented vowels, math symbols, and graphical box characters.
ISCII8 bits$2^8 = 256$Indian Script Code for Information Interchange (Bureau of Indian Standards, 1991). Retains standard ASCII in lower 128 codes; upper 128 codes represent phonetic equivalents across 10 Indian scripts (Devanagari, Bengali, Tamil, Telugu, etc.).
UnicodeVariable (1 to 4 bytes)Over $1,114,112$ code points ($U+0000$ to $U+10FFFF$)Universal standard encoding every modern and historical writing script, mathematical symbol, and emoji worldwide.
Unicode Transformation Formats (UTF):
  • UTF-8: Variable-length encoding using 1 to 4 bytes. 100% backward compatible with 7-bit ASCII (uses only 1 byte for ASCII chars). Dominates the World Wide Web (used by >98% of websites).
  • UTF-16: Uses 2 or 4 bytes per character. Default internal string representation in Java, Python 3 (variable width internally), and Windows APIs.
  • UTF-32: Fixed-width 4 bytes (32 bits) for every character. Fast memory indexing, but highly memory-inefficient for Latin text.

Key Programming Syntax, Statements & Translator Rules

General Radix Expansion
$$N = \sum_{i=-m}^{n} d_i \cdot r^i$$
Converts any base-r representation to decimal.
Maximum Value of n-bit Binary
$$V_{\max} = 2^n - 1$$
An 8-bit unsigned byte spans 0 to 255.
2's Complement Range
$$[-2^{n-1}, +2^{n-1} - 1]$$
For 16-bit signed integer (short in Java): -32,768 to +32,767.
2's Complement Identity
$$\text{2's Comp}(X) = 2^n - X$$
Mathematical definition for n-bit integer X.

Number Systems Inter-Conversion & Encoding Architecture

Number Systems & Character Encoding Matrix Decimal (10) Digits: 0 to 9 Binary (2) Bits: 0 and 1 Hexadecimal (16) 0-9, A-F (4 bits) Octal (8) 0 to 7 (3 bits) / 2 & x 2 / 16 & x 16 3-Bit Groups 4-Bit Groups (Nibbles) Character Encoding Evolution ASCII (7-bit, 128) → ISCII (8-bit, 256 Indic) → Unicode (UTF-8 / UTF-16 / UTF-32: 1,114,112 symbols)

Chapter Summary & 10 Key Takeaways

Takeaway 1
A positional number system values each digit based on its intrinsic face value, its position index, and the base (radix) $r$.
Takeaway 2
Standard computer number systems include Binary (Base 2), Octal (Base 8), Decimal (Base 10), and Hexadecimal (Base 16).
Takeaway 3
Decimal to base-$r$ conversion employs successive integer division for whole parts and successive multiplication for fractional parts.
Takeaway 4
Binary-to-Octal conversion groups bits into sets of 3 ($2^3 = 8$); Binary-to-Hexadecimal groups bits into sets of 4 ($2^4 = 16$).
Takeaway 5
2's complement is formed by inverting all bits (1's complement) and adding 1 to the LSB.
Takeaway 6
2's complement eliminates duplicate zero representations, yielding an asymmetric range of $[-2^{n-1} \text{ to } +2^{n-1} - 1]$ for an $n$-bit integer.
Takeaway 7
Standard ASCII uses 7 bits to encode 128 characters, covering uppercase English (65–90), lowercase English (97–122), and digits (48–57).
Takeaway 8
ISCII (Indian Script Code for Information Interchange) uses 8 bits, retaining ASCII in the lower 128 codes and mapping phonetic equivalents across 10 Indian scripts in the upper 128 codes.
Takeaway 9
Unicode assigns a universal code point ($U+XXXX$) to over 1.1 million characters across all human languages, scripts, and emojis.
Takeaway 10
UTF-8 is a variable-width encoding (1 to 4 bytes) that is completely backward compatible with 7-bit ASCII, making it the dominant web standard.

Check Your Understanding (Diagnostic Practice Questions)

Diagnostic questions testing core conceptual clarity. Answers are hidden initially — solve each problem first, then click to reveal the step-by-step verified solution.

1
Convert the decimal number $(247.375)_{10}$ into its equivalent binary representation.
Reveal Answer & Explanation
Answer: Integer Part: Successive division of 247 by 2 yields remainders from bottom to top: $247 \div 2 = 123\text{ R}1$, $123 \div 2 = 61\text{ R}1$, $61 \div 2 = 30\text{ R}1$, $30 \div 2 = 15\text{ R}0$, $15 \div 2 = 7\text{ R}1$, $7 \div 2 = 3\text{ R}1$, $3 \div 2 = 1\text{ R}1$, $1 \div 2 = 0\text{ R}1$. Whole part $= 11110111_2$.
Fractional Part: Successive multiplication of 0.375 by 2: $0.375 \times 2 = 0.75$ (int 0), $0.75 \times 2 = 1.50$ (int 1), $0.50 \times 2 = 1.00$ (int 1). Fraction $= .011_2$.
Final result: $(11110111.011)_2$.
Divide 247 by 2 recording remainders; multiply 0.375 by 2 recording integer parts.
2
Convert the binary number $(110101101101.1011)_2$ into both Octal and Hexadecimal directly without converting to decimal.
Reveal Answer & Explanation
Answer: Octal (groups of 3 bits):
Integer: `110 101 101 101` → `6 5 5 5`
Fraction: `101 100` (pad two 0s right) → `5 4`
Octal $= (6555.54)_8$.

Hexadecimal (groups of 4 bits):
Integer: `1101 0110 1101` → `D 6 D`
Fraction: `1011` → `B`
Hexadecimal $= (\text{D}6\text{D}.\text{B})_{16}$.
Group into 3 bits from binary point for octal; group into 4 bits for hexadecimal.
3
Represent $-45$ as an 8-bit signed integer using 2's complement representation.
Reveal Answer & Explanation
Answer: Step 1: Write $+45$ in 8-bit binary: $45 = 32 + 8 + 4 + 1 = 00101101_2$.
Step 2: Take the 1's complement (invert all bits): $11010010_2$.
Step 3: Add 1 to the LSB: $11010010 + 1 = 11010011_2$.
Therefore, $-45$ in 8-bit 2's complement is $11010011_2$.
Convert 45 to 8-bit binary, invert all bits, and add 1.
4
Explain why 2's complement representation is universally preferred over sign-magnitude and 1's complement in computer processor ALU design.
Reveal Answer & Explanation
Answer: 2's complement solves two fundamental engineering drawbacks: First, sign-magnitude and 1's complement both produce two distinct representations for zero ($+0$ and $-0$), which requires extra testing logic in the ALU. Second, 2's complement allows subtraction ($A - B$) to be performed directly by adding the 2's complement of $B$ to $A$ using the exact same standard binary adder circuitry without needing separate subtractor circuits.
Eliminates double zero and allows addition circuitry to perform subtraction.
5
What is the decimal ASCII value of character 'A', 'a', and '0'? What is the mathematical relationship between uppercase and lowercase ASCII codes?
Reveal Answer & Explanation
Answer: ASCII 'A' $= 65$, 'a' $= 97$, and '0' $= 48$. The difference between any uppercase letter and its lowercase counterpart is exactly $32$ ($97 - 65 = 32$). In binary, $32$ is $2^5 = 00100000_2$. Therefore, toggling bit 5 (setting bit 5 to 1) converts an uppercase letter to lowercase; clearing bit 5 converts lowercase to uppercase.
Uppercase and lowercase differ by exactly 32 (bit 5).
6
What was the primary design objective behind ISCII, and how did it achieve inter-script transliteration across Indian languages?
Reveal Answer & Explanation
Answer: ISCII was developed by the Bureau of Indian Standards in 1991 to standardize digital text across Indian languages. It achieved seamless transliteration by mapping identical phonetic characters across 10 major Indian writing systems to the exact same 8-bit numeric code. A text file written in Devanagari could be rendered in Bengali or Tamil simply by switching the display font without modifying the underlying character bytes.
Shared phonetic code points across 10 Indian scripts enabled font-level transliteration.
7
Why has UTF-8 become the undisputed dominant character encoding standard for the World Wide Web over UTF-16 and UTF-32?
Reveal Answer & Explanation
Answer: UTF-8 is a variable-width encoding (1 to 4 bytes) that is 100% backward compatible with 7-bit ASCII: any valid ASCII file is identical to a UTF-8 file and uses only 1 byte per character. In contrast, UTF-16 and UTF-32 require 2 and 4 bytes respectively even for plain English text, doubling or quadrupling memory consumption and network bandwidth. Furthermore, UTF-8 has no byte-order endianness issues (no Byte Order Mark required).
Backward compatible with 7-bit ASCII, uses 1 byte for English, and saves network bandwidth.
8
Perform binary addition: $(110111)_2 + (101101)_2$. Express the sum in both binary and decimal to verify your answer.
Reveal Answer & Explanation
Answer: Binary Addition:
  110111 (55 in decimal)
+ 101101 (45 in decimal)
---------
= 1100100 (in binary).
Verification in decimal: $2^6 + 2^5 + 2^2 = 64 + 32 + 4 = 100$. Since $55 + 45 = 100$, the addition is verified.
Add column-by-column carrying 1 when $1 + 1 = 10_2$.
Finished Studying This Chapter?
READY TO PRACTICE?

Timed CBT Practice Tests (Exam Simulator)

Put your concepts to the test with official curriculum-aligned Foundation and Advanced practice tests. Get instant accuracy scores, time metrics, and step-by-step verified explanations.

Foundation Test
15 MCQs • Core Concepts
Advanced Test
15 MCQs • HOTS & Traps

All Class 11 Computer Science Chapters

AI Study Friend

Instant Concept Tutor

Have a doubt in Encoding Schemes and Number System? Ask our AI study tutor for rapid explanations or customized quizzes.