Binary–hexadecimal conversion — match each binary value to its hex equivalent List I (Binary) A. 10101010 B. 11111111 C. 10001000 D. 10010010 List II (Hex) 1. FF 2. 88 3. 92 4. AA

Difficulty: Easy

Correct Answer: A-4, B-1, C-2, D-3

Explanation:


Introduction / Context:
Converting between binary and hexadecimal is routine in digital electronics and debugging. Each hex digit represents exactly four binary bits, simplifying grouping and interpretation of byte patterns.


Given Data / Assumptions:

  • Group binary strings into 4-bit nibbles from the left.
  • Map each nibble to its hex digit (0000→0 … 1111→F).


Concept / Approach:
Translate each 8-bit pattern by splitting into two nibbles and converting each nibble to hex, then concatenating the two hex digits.


Step-by-Step Solution:

A: 1010 1010 → A A → AA.B: 1111 1111 → F F → FF.C: 1000 1000 → 8 8 → 88.D: 1001 0010 → 9 2 → 92.


Verification / Alternative check:
Cross-check with decimal: 10101010₂ = 170₁₀ = 0xAA; 11111111₂ = 255₁₀ = 0xFF; 10001000₂ = 136₁₀ = 0x88; 10010010₂ = 146₁₀ = 0x92.


Why Other Options Are Wrong:

  • Any option assigning non-matching hex values ignores the 4-bit grouping rule.


Common Pitfalls:
Grouping from the wrong end or misreading 1001 as 1000; forgetting leading zeros when the bit-count is not a multiple of 4.


Final Answer:
A-4, B-1, C-2, D-3

More Questions from Matching Questions

Discussion & Comments

No comments yet. Be the first to comment!
Join Discussion