Number Systems & Binary Data Representation (Radix 2, 8, 10, 16)
Unit 1: Computer Evolution, Architecture & Number Systems • Fundamentals of Computer
👨🏫 Professor's Mental Model: The Language of Light Switches
Computer ki har memory cell ek electronic transistor switch hai jo ya toh ON hota hai (1) ya OFF hota hai (0). Jaise hum insaan 10 ungliyon ki wajah se Decimal (0-9) number system use karte hain, waise hi computer switches ki wajah se Binary (0 and 1) use karta hai. Hexadecimal (Base 16) lambe 32-bit binary codes ko chota karke likhne ka shortcut hai!
Interactive Radix Lab & Step-by-Step Notebook
Learn Radix Conversions, Successive Division Ladders, Nibble Mapping & 2's Complement Arithmetic.
Conversion Solution for (25.625)₁₀ → Binary
Repeatedly divide the value by Base 2 until quotient is 0. Collect remainders in reverse order: Bottom to Top (MSB ↑ to LSB).
Repeatedly multiply the fractional part by Base 2. Extract the integer parts in order: Top to Bottom (MSB ↓ to LSB).
(11001) + Fractional Part (.101)Academic Lecture Notes & Solved Study Pages
Unit 1 • Core Concepts, Step-by-Step Proofs & Notebook Solutions
1. Positional Number Systems Overview
Decimal Number System
Natural human number system with 10 fingers. Standard positional base.
Binary Number System
Native language of computers. 0 = OFF (Low Voltage), 1 = ON (High Voltage).
Octal Number System
Compact shorthand. Exactly 1 Octal digit maps to 3 binary bits (2³ = 8).
Hexadecimal Number System
Industry standard for RAM addresses. Exactly 1 Hex digit maps to 4 binary bits (1 Nibble).
2. Step-by-Step Radix Conversion Formulas
Decimal to Other Bases (Successive Division & Multiplication Method)
Continuously divide by the target base (r) until quotient becomes 0. Collect remainders from Bottom to Top (MSB to LSB ↑).
Continuously multiply fractional part by base (r). Extract and collect integer parts from Top to Bottom (↓).
Other Bases to Decimal (Positional Weight Expansion Method)
Multiply each digit by its positional weight (Base^Position) and sum them up:
= (1 × 2³) + (1 × 2²) + (0 × 2¹) + (1 × 2⁰) + (1 × 2⁻¹)
= 8 + 4 + 0 + 1 + 0.5
= (13.5)₁₀
Fast Binary ↔ Octal (3-bit) & Hexadecimal (4-bit) Shortcuts
Replace each octal digit with its 3-bit binary equivalent:
(75)₈ = (111 101)₂Replace each hex digit with its 4-bit binary nibble:
(A3)₁₆ = (1010 0011)₂3. 1's Complement & 2's Complement Arithmetic
Invert every bit: change 0 → 1 and 1 → 0.
101100 is 010011Add 1 to the 1's complement: 1's Comp + 1.
010011 + 1 = 0101004-Step Subtraction Algorithm (M - N):
| Decimal | 4-Bit Binary | Octal | Hexadecimal |
|---|---|---|---|
| 0 | 0000 | 0 | 0 |
| 1 | 0001 | 1 | 1 |
| 2 | 0010 | 2 | 2 |
| 3 | 0011 | 3 | 3 |
| 4 | 0100 | 4 | 4 |
| 5 | 0101 | 5 | 5 |
| 6 | 0110 | 6 | 6 |
| 7 | 0111 | 7 | 7 |
| 8 | 1000 | 10 | 8 |
| 9 | 1001 | 11 | 9 |
| 10 | 1010 | 12 | A |
| 11 | 1011 | 13 | B |
| 12 | 1100 | 14 | C |
| 13 | 1101 | 15 | D |
| 14 | 1110 | 16 | E |
| 15 | 1111 | 17 | F |
🎯 University Exam Scoring Blueprint
- Solve number system numericals with neat step-by-step division ladders.
- Write the rule for 2's complement subtraction (Carry discarded = Positive result; No carry = Negative 2's complement).
- Remember: Hex digits A to F represent values 10 to 15.