using last 2 octal digits 17 will be 001111 in binary hence las hex digit will be F, So option D can be further eliminated.

The Gateway to Computer Science Excellence

+19 votes

+21 votes

Best answer

*Answer: (b)*

Here are two different ways of solving this problem.

**Short Method**

Given number is in base 8 thus each digit can be represented in three binary bits to get overall binary equivalent.

$$(1217)_8 = (001\ 010\ 001\ 111)_2$$

I have written the equivalent in group of three bits for easy understanding of the conversion. We can rearrange them in group of four to get equivalent hexadecimal number (in similar manner).

$$(001 010 001 111)_2 = (0010\ 1000\ 1111)_2 = (28F)_{16}$$

**Long Method**

In a nut shell the long method follow the following conversion

$$OCT \rightarrow DEC \rightarrow HEX$$

This procedure is good in a sense that the given option also have a decimal equivalent, and thereby might save some time (no in this case, unfortunately).

Here is the the decimal equivalent

$$(1217)_8 = (1*8^3 + 2*8^2 + 1*8^1 + 7*8^0)_{10} = (655)_{10}$$

And we see that decimal equivalent is not in option therefore we proceed for hexadecimal conversion using division method.

$$(655)_{10} = (28F)_{16}$$

Which we can find in given options.

HTH

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,292 answers

198,235 comments

104,918 users