Q#1
a) Having 8-bit Unsigned Number Scheme, Subtract (230)$_{10}$ from (130)$_{10}$ using 2's complement.
b) Having 8-bit Signed Number Scheme, Subtract (44)$_{10}$ from (-65)$_{10}$ using 2's complement.
Q#2
Convert each of the following to other canonical form:
a) F(x, y, z) = x'y'z + x'yz + xyz
b) F(A,B,C,D) = (A+B+C+D)(A+B+C+D')(A+B+C'+D)(A+B'+C+D)(A+B'+C'+D')
(A'+B+C+D')(A'+B'+C+D)
Q#3
Consider the following Boolean Function together with don't care conditions d.
F(A,B,C,D) = (A+B) . (A'+C'+D') . (A'+C+D')
d(A,B,C,D) = (A + B'+C) . (A + B' +D')
Simplify this Boolean function using K-Map method and implement it using
a) NAND gates only.
b) NOR gates only
Q#4
Consider the following Boolean Function together with don't care conditions
F(A,B,C,D) = (A + B'+C) . (A + B' + D')
d(A,B,C,D) = (0,6,8,13,14)
Simplify the above Boolean function using K-Map method and implement it using NAND gates
only.