### Discussion :: Digital Computer Electronics - Section 1 (Q.No.1)

Bhanu said: (Apr 16, 2011) | |

2| 61 2| 30- 1 2| 15- 0 2| 7- 1 2| 3- 1 | 1- 1 DIVIDE 61 BY 2 QUOTIENT 30 . HERE 1 IS REMAINDER DIVIDE 30 BY 2 QUOTIENT 15 . HERE 0 IS REMAINDER DIVIDE 15 BY 2 QUOTIENT 7 . HERE 1 IS REMAINDER DIVIDE 7 BY 2 QUOTIENT 3 . HERE 1 IS REMAINDER DIVIDE 3 BY 2 QUOTIENT 1 . HERE 1 IS REMAINDER so we collect remainder like this 111101 in binary value |

Dheeraj Kumar said: (Nov 14, 2012) | |

61 = (2^5)*1+(2^4)*1+(2^3)*1+(2^2)*1+(2^1)*0+(2^0)*1. So binary equivalent of decimal 61 is (111101). |

Jagrati Goyal said: (Mar 4, 2013) | |

Firstly 61/2=30 remainder=1. And then 30/2=15 remainder=0. And then 15/2=7 remainder=1. And then 7/2=3 remainder=1. And then 3/2=1 remainder=1. Since we read bottom to top so finally answer is 111101 in binary. |

Saptarshi Ghosh said: (Dec 3, 2013) | |

61 - odd number right, (B) cancelled immediately. Max 2^n < 61 is 32 ie 2^5 => result will be 5+1 = 6 bits, (D) Cancelled A. 110011 - 32+16+3 Cancelled C. 111101 - 32+16+13 = 61 Another way, 61 = 63-2, 63 = 111111-000010 = 111101. |

Rahul Jain said: (Jun 26, 2014) | |

To convert a decimal number into the binary number, you have to go through the following procedure: 1. Divide 61 by 2, which gives a remainder of 1. 2. Divide the Quotient (30 in the case) by 2, which gives a remainder of 0. 3. Divide the Quotient (15 in the case) by 2, which gives a remainder of 1. 4. Divide the Quotient (7 in the case) by 2, which gives a remainder of 1. 5. Divide the Quotient (3 in the case) by 2, which gives a remainder of 1. 6. Divide the Quotient (1 in the case) by 2, which gives a remainder of 1. Examine all the remainders in the backward flow(from 6 to 1 in our case), which gives 111101. This is your answer. |

Aakash Rahtore said: (Sep 27, 2016) | |

Thanks for explaining the answer. |

Vishnu said: (Nov 27, 2016) | |

Thanks for explaining it in different way. |

Hafiz Qireshi said: (Dec 20, 2017) | |

Good explanation. Thanks. |

Rajib Kumar Halder said: (Apr 10, 2018) | |

--> divide in half ignore remainder. Let 61; 1 3 7 15 30 61. Now put 0 for even number and 1 for an odd number. 1 1 1 1 0 1. |

Janhavi said: (Apr 20, 2019) | |

Thanks for explaining. |

#### Post your comments here:

Name *:

Email : (optional)

» Your comments will be displayed only after manual approval.