Computer Science - Digital Computer Electronics - Discussion
Discussion Forum : Digital Computer Electronics - Section 1 (Q.No. 1)
1.
Conversion of decimal number 6110 to it's binary number equivalent is
Discussion:
11 comments Page 1 of 2.
Pratyaksha Sinha said:
4 years ago
Thanks for explaining.
Janhavi said:
6 years ago
Thanks for explaining.
Rajib Kumar Halder said:
7 years ago
--> 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.
1 3 7 15 30 61.
Now put 0 for even number and 1 for an odd number.
1 1 1 1 0 1.
(2)
Hafiz qireshi said:
7 years ago
Good explanation. Thanks.
Vishnu said:
9 years ago
Thanks for explaining it in different way.
Aakash rahtore said:
9 years ago
Thanks for explaining the answer.
Rahul Jain said:
1 decade ago
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.
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.
Saptarshi ghosh said:
1 decade ago
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.
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.
Jagrati goyal said:
1 decade ago
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.
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.
(3)
Dheeraj kumar said:
1 decade ago
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).
So binary equivalent of decimal 61 is (111101).
(1)
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers