Assignment 1
Assignment 1
Question 1: Perform the arithmetic operations (+42)+(-13) and (-42)-(-13) in binary using the 2’s
complement representation for negative numbers.
Question 2: Express the following in terms of sum of minterms and product of maxterms:
a) F(A,B,C,D) = B’D + A’D + BD
b) F(x,y,z) = (xy+z)(xz+y)
Question 3: Simplify the Boolean function F together with the don’t care conditions d in (i) sum
of products and (ii) products of sums.
a) F(w,x,y,z) = Ʃ (0,1,2,3,7,8,10)
d(w,x,y,z) = Ʃ (5,6,11,15)
b) F(A,B,C,D) = Ʃ(3,4,13,15)
d(A,B,C,D) = Ʃ(1,2,5,6,8,10,12,14)
Question 4: Simplify the following Boolean expression using three variable map:
a) xy + x’y’z’ + x’yz’
b) x’y’ + yz + x’yz’
c) A’B + BC’ + B’C’
Question 5: Design a combinational circuit with three inputs, x, y and z, and three outputs A, B,
C. When the binary input is 0, 1, 2 or 3, the binary output is one greater than the input. When the
binary input is 4, 5, 6 or 7, the binary output is one less than the input.
Question 6: Design a combinational circuit that adds one to a 4-bit binary number, A3A2A1A0.
For example, if the input of the circuit is A3A2A1A0 = 1101, the output is 1110. The circuit can be
designed using four half adders.
Question 7: Design a code converter that converts a decimal digital from the 84-2-1 code to
BCD. Look the following table for the 84-2-1 and BCD codes
Question 8: Derive the truth table of the circuit shown in the following figure: