Digital Electronics - Training Sheet
Digital Electronics - Training Sheet
Exercise 2:
1. Convert the following decimal numbers into their equivalent binary numbers: (i) 336 (ii) 679
(iii) 5797 (iv) 4391
2. Convert the following binary numbers into their equivalent decimal numbers: (i) 1010111 (ii)
1110101 (iii) 100010011 (iv) 110010001
3. Convert the following binary numbers into their octal, hexadecimal and decimal
equivalent: (i) 1011101 (ii) 10101011101 (iii) 1001010111 (iv) 10111101
4. Convert the following decimal numbers into binary numbers. (i) 697.625 (ii) 1457.23 (iii)
22097.96 (iv) 39870.0625
5. Convert the following binary numbers to their equivalent octal and hexadecimal numbers. (i)
11011011.011 (ii) 101110111.1011 (iii) 1011111001.111011 (iv) 1000101011.011011
6. Perform the following binary additions.
(i) 11010111 +1011010 (ii) 10111101.101 + 10101001.011
(iii) 100101101.101 + 10010110.01
(iv) 111010110.1101+10111011.0101
7. Perform the following binary subtraction.
i) 11010011 – 1010010 (ii) 10100101.101 – 10111001.001
(iii) 100101011.001 – 10100110.01
(iv) 110010110.1001–10100011.0111
8. Solve the following:
(i) (11001)2 ÷ (1011)2= (?)2 (ii) (101010)2 ÷ (1001)2= (?)2
9. Perform the following operations in 12-bit system using 2’s complement method.
– 149 – 126
10. Convert the following BCD (8421) code numbers to decimal numbers:
(i) 0100001100000110
(ii) 0010100101110000
(iii) 1001100000000001
(iv) 0101010000100001
11. Convert the following excess –codes to decimal numbers:
(i) 1100011101011001
(ii) 0101011000110110
(iii) 0110011101000101
(iv) 1000010010111001
12. Construct 7 –bit even parity Hamming code for transmitting the following digital data: (i)
0101 (ii) 1000 (iii) 0110
13. Simplify the following Boolean functions using K –map and verify your answer using the
theorems of Boolean algebra also.
14. Simplify the following Boolean functions using K –map and realized the minimized
functions with NAND gates only.
15. Design a half subtractor using NAND gates only. A half subtractor may be designed by the
same method as the half adder. Complete the truth table below in which X0 and Y0 are the
minuend and subtrahend respectively; D0 the difference of the two bits (X0& Y0) and B0 is
the borrow bit from the next bit.
16. Design a Full subtractor using NAND gates only. The truth table for full subtractor is shown in
table 5.11, in which X1, Y1 are the minuend and subtrahend respectively and B0is the borrow
bit from the previous bit. The output terms D1 and B1are the difference bit and borrow to
the next bit.
18.