Module 2 - Boolean Algebra and Logic Circuits
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. Compute:
(i) The 10’s Complement of (52520)10
(ii)The 10’s Complement of (0.3267)10
(iii)The 10’s complement of (25.639)10
12. Compute:
(i)The 2’s Complement of (101100)2
(ii)The 2’s Complement of (0.0110)2
[Link] 10’s Complement, Subtract 03250 from 72532
[Link] 10’s Complement, Subtract 72532 from 03250
[Link] 2’s Complement subtract (1010100)2 – (1000100)2
[Link] 2’s Complement subtract (1000100)2 - (1010100)2
[Link] 9’s Complement, Subtract 03250 from 72532
18. Using 9’s Complement, Subtract 72532 from 03250
19. Using 1’s Complement subtract (1010100)2 – (1000100)2
20. Using 1’s Complement subtract (1000100)2 - (1010100)2
[Link] the six basic laws(common Postulates) which is used to formulate the various algebraic
structures.
[Link] Axiomatic definition of Boolean algebra and also mention its postulates.
[Link] that the Huntington postulates are valid for the set B={0,1} and the two binary operators +
and .
[Link] that
(i) x+x=x (iii)x(x+y)=x
(ii)x+xy=x
[Link] and Prove De-Morgan’s theorems for two variables.
[Link] the Venn diagram for two variables.
[Link] the below expressions using Venn diagram
(i)x=xy+x (ii)x(y+z) = xy+xz
[Link] the below boolean functions using TRUTH TABLE and LOGIC GATES
I I I I I I
(i)F1 = xyz (ii)F2 = x+y z (iii) F3 =x y z +x yz+xy
I I
(iv)F4 = xy + x z
[Link] the following Boolean functions to a minimum number of literals
I I I I I I
(i)x+x y (ii)x(x +y) (iii) x y z +x yz+xy
I
(iv)xy+x z+yz.
I I I I I I
[Link] the complement of the functions F1=x yz + x y z and F2=x(y z +yz)
I
[Link] the Boolean function F= A +B C in a sum of minterms.
I
[Link] the Boolean function F=xy +x z in a product of maxterm form.
[Link] the following to the other canonical form.
(i)F(A,B,C)=Ʃ(1,4,5,6,7)
(ii)F(x,y,z)= Ʃ(1,3,7)
(iii)F(A,B,C)=Π(0,2,4,5)
(iv)F(A,B,C,D)= Π(0,1,2,3,4,6,12)
[Link] sum of product(SOP) and product of sum(POS) with an examples.
[Link] are logic gates? Write the graphic symbol, algebraic function and truth table of all 8 digital
logic gates.
[Link] the following functions in a sum of minterms and a product of maxterms.
I I
(i)F(A,B,C,D)=D(A +B) +B D
I I I I I
(ii)F(w,x,y,z)=y z +wxy +wxz +w x z
(iii)F(x,y,z)=(xy+z)(y+xz)
