Skip to content
Question Bank (2 marks) · Q9

Q.Convert the gray code 1000 into binary using XOR gates.

Karnataka PUCTextbookNumeric· 2mImportance★★★★★est
27% · 43/160 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

[!TLDR]

Copy the MSB and XOR each previous binary bit with the next gray bit: gray 10001000 converts to binary 11111111.

The rule for gray-to-binary conversion using XOR gates is:

  1. The most significant binary bit equals the most significant gray bit.
  2. Every other binary bit is obtained by XOR-ing the immediately higher (already found) binary bit with the corresponding gray bit.

Let the gray input be G3G2G1G0=1000G_3 G_2 G_1 G_0 = 1000 and the binary output be B3B2B1B0B_3 B_2 B_1 B_0:

  • B3=G3=1B_3 = G_3 = 1
  • B2=B3⊕G2=1⊕0=1B_2 = B_3 \oplus G_2 = 1 \oplus 0 = 1
  • B1=B2⊕G1=1⊕0=1B_1 = B_2 \oplus G_1 = 1 \oplus 0 = 1
  • B0=B1⊕G0=1⊕0=1B_0 = B_1 \oplus G_0 = 1 \oplus 0 = 1 …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.