Skip to content
Exercises · Q9

Q.Write binary equivalent of the following octal numbers.

(i) 2306
(ii) 5610
(iii) 742
(iv) 65.203
Odisha ChseTextbookSubjective· 3mImportance★★★★★est
76% · 34/45 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 →

Since 8 = 2^3, every octal digit corresponds to exactly one 3-bit binary group — replace each digit by its 3-bit form (0=000, 1=001, 2=010, 3=011, 4=100, 5=101, 6=110, 7=111) and you are done.

Why digit expansion works. Octal is a power-of-two base, so the conversion is a pure re-labelling: no division or multiplication is needed. Every digit — including digits of the fractional part — must contribute its FULL 3 bits; only leading zeros of the final number may be dropped.

(i) (2306)8

2 -> 010, 3 -> 011, 0 -> 000, 6 -> 110
(2306)8 = 010 011 000 110 = (10011000110)2

(ii) (5610)8

5 -> 101, 6 -> 110, 1 -> 001, 0 -> 000
(5610)8 = 101 110 001 000 = (101110001000)2

(iii) (742)8

7 -> 111, 4 -> 100, 2 -> 010
(742)8 = 111 100 010 = (111100010)2

(iv) (65.203)8 — fractional digits expand exactly the same way

6 -> 110, 5 -> 101 . 2 -> 010, 0 -> 000, 3 -> 011
(65.203)8 = 110 101 . 010 000 011 = (110101.010000011)2

Verify the integer cases in Python:

for o in ["2306", "5610", "742"]: …

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.