Introduction of Electronics and Communication Module 3

Module 3

1. Convert the following binary numbers to decimal:

(i) 101110 (ii) 1110101.11 (iii) 110110100
2. Convert the following:
i. (1AD.E0)16=(?)10
ii. (37.625)10=(?)2
iii. (110100111001.110)2=(?)8
iv. (345.AB)16=(?)2
3. Convert the following:
i. (2AB.8)16=(?)10
ii. (416.12)10=(?)8
iii. (25.375)10=(?)2
iv. (16.2)8=(?)16
4. Convert the following numbers to its equivalent numbers and show the steps:
i) (10110001101011.111100000)2 = (?)8
ii) (10110001101011.11110010)2 = (?)16
iii) (1010.011)2 = (?)10
5. Convert Decimal to Binary: (i) 41 (ii)153 (iii)) 0.6875 (iv) 0.513
6. Convert Binary to Decimal: (i) 110111 (ii) 10101010 (iii) 0110 (iv) 100.1010
7. Convert the following:
i. (110.1101)2=(?)10
ii. (847.951)10=(?)8
iii. (CAD.BF)16=(?)10
8. Convert the following:
i. (225)10=(?)2=(?)8=(?)16
ii. (11010111)2=(?)10=(?)8=(?)16
iii. (623)8=(?)10=(?)2=(?)16
iv. (2AC5)16=(?)10=(?)8=(?)2
9. Convert the following:
a) (306.D)16=(?)2
b) (41)10=(?)2
c) Compute 1’s complement of (11101)2
d) Compute 9’s complement of (0.3267)10
10. Convert the following:
a) 3A6.C58D(16) = ?(8)
b) 0.6875(10) = ?(2)
c) Compute the 9’s complement of 25.639(10)
d) Compute the 1’s complement of 11101.0110(2)
11. i) Subtract using 10’s complement method (Nov ’23 – 6M)
M=72532, N=03250

1|Page
Introduction of Electronics and Communication Module 3

ii) Subtract using 2’s complement method

M=1010100,N=1000100
12. Perform the following operations:
i) 1101−0101 using 2’s complement method
ii) 0110−0010 using 2’s complement method
iii) 924−126 using 9’s complement method
iv) 265−424 using 10’s complement method
13. Perform the following:
i) (1010100)2−(1000100)2 using 1’s complement and 2’s complement method.
ii) (4456)10−(34234)10 using 9’s complement and 10’s complement method.
14. Subtract the following using 10’s complement:
i) (72532−3250)10
ii) (3250−72532)10
15. Subtract using (r−1)’s complement method
a) 4456(10) −34234(10)
Subtract using r’s complement method
a) 1010100(2) −1000100(2)
16. Mention the different theorems and postulates of Boolean algebra and prove each of them
with truth table.
17. State and prove De Morgan’s theorem with its truth table.
18. Using basic Boolean theorems, prove
(number 25)
19. Explain SOP & POS with examples.
20. What are logic gates? Write the graphic symbol, algebraic function and truth table of all 8
logic gates.
21. Describe how NAND and NOR gates can be used as universal gates.
22. Write the step-by-step procedure to design a combinational circuit.
23. Design a half adder with necessary logic diagram and expressions.
24. With the help of truth table explain the operation of full adder with its circuit diagram and
reduce the expression for sum and carry.
25. Design a full adder using two half adders and an OR-gate.

2|Page
Introduction of Electronics and Communication Module 3

1. Convert the following binary numbers to decimal:

(i) 101110 (ii) 1110101.11 (iii) 110110100
2. Convert the following:
i) (1AD.E0)16=(?)10
ii) (37.625)10=(?)2
iii) (110100111001.110)2=(?)8
iv) (345.AB)16=(?)2
3. Convert the following:
i. (2AB.8)16=(?)10
ii. (416.12)10=(?)8
iii. (25.375)10=(?)2
ii) (16.2)8=(?)16
4. Convert the following numbers to its equivalent numbers and show the steps:
i) (10110001101011.111100000)2 = (?)8
ii) (10110001101011.11110010)2 = (?)16
iii) (1010.011)2 = (?)10
5. Convert Decimal to Binary: (i) 41 (ii)153 (iii)) 0.6875 (iv) 0.513
6. Convert Binary to Decimal: (i) 110111 (ii) 10101010 (iii) 0110 (iv) 100.1010
7. Convert the following:
i. (110.1101)2=(?)10
ii. (847.951)10=(?)8
iii. (CAD.BF)16=(?)10
8. Convert the following:
i. (225)10=(?)2=(?)8=(?)16
ii. (11010111)2=(?)10=(?)8=(?)16
ii. (623)8=(?)10=(?)2=(?)16
iii. (2AC5)16=(?)10=(?)8=(?)2
9. Convert the following:
a) (306.D)16=(?)2
b) (41)10=(?)2
c) Compute 1’s complement of (11101)2
d) Compute 9’s complement of (0.3267)10
10. Convert the following:
a) 3A6.C58D(16) = ?(8)
b) 0.6875(10) = ?(2)
c) Compute the 9’s complement of 25.639(10)
d) Compute the 1’s complement of 11101.0110(2)
11. i) Subtract using 10’s complement method (Nov ’23 – 6M)
(i) M=72532, N=03250
(ii) ii) Subtract using 2’s complement method

3|Page
Introduction of Electronics and Communication Module 3

(iii) M=1010100,N=1000100
12. Perform the following operations:
i) 1101−0101 using 2’s complement method
ii) 0110−0010 using 2’s complement method
iii) 924−126 using 9’s complement method
iv) 265−424 using 10’s complement method
13. Perform the following:
i) (1010100)2−(1000100)2 using 1’s complement and 2’s complement
method.
ii) (4456)10−(34234)10 using 9’s complement and 10’s complement
method.
14. Subtract the following using 10’s complement:
i) (72532−3250)10
ii) (3250−72532)10
15. Subtract using (r−1)’s complement method
a) 4456(10) −34234(10)
(ii) Subtract using r’s complement method
a) 1010100(2) −1000100(2)
16. Mention the different theorems and postulates of Boolean algebra and prove each of them
with truth table.
17. State and prove De Morgan’s theorem with its truth table.
Answer:

4|Page
Introduction of Electronics and Communication Module 3

18. Using basic Boolean theorems, prove

(i) (number 25)
19. Explain SOP & POS with examples.
20. What are logic gates? Write the graphic symbol, algebraic function and truth table of all 8
logic gates.
Answer:

5|Page
Introduction of Electronics and Communication Module 3

21. Describe how NAND and NOR gates can be used as universal gates.
22. Write the step-by-step procedure to design a combinational circuit.
23. Design a half adder with necessary logic diagram and expressions.
24. With the help of truth table explain the operation of full adder with its circuit diagram and
reduce the expression for sum and carry.
25. Design a full adder using two half adders and an OR-gate.

6|Page
Introduction of Electronics and Communication Module 3

7|Page