edited by
7,953 views
25 votes
25 votes

$(1217)_8$ is equivalent to

  1. $(1217)_{16}$
  2. $(028F)_{16}$
  3. $(2297)_{10}$
  4. $(0B17)_{16}$
edited by

6 Answers

Best answer
28 votes
28 votes

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

selected by
5 votes
5 votes
The answer is B.

The simple way is... you can convert every option to decimal equivalent, which is easier to convert. as well as the one in question too. Compare and you'll get B.
Answer:

Related questions

24 votes
24 votes
6 answers
3
Kathleen asked Sep 22, 2014
17,441 views
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes?$8$$32$$64$$128$
43 votes
43 votes
6 answers
4
Kathleen asked Sep 22, 2014
19,922 views
What is the minimum number of gates required to implement the Boolean function $\text{(AB+C)}$ if we have to use only $2\text{-input NOR}$ gates?$2$$3$$4$$5$