Key Answers for Descriptive Questions

Ques. Simplify the expression F(x,y,z) = x'yz + x'yz' + xz

F(x,y,z) = x'yz + x'yz' + xz

= x'y(z + z') + xz (Distributive)
= x'y(1) + xz (Inverse)
= x'y + xz (Identity)

Ques.If a number has m digits in hexadecimal, how many bits does it have in
binary form?. Further convert decimal value (0.68) to binary fraction.

m/4
0.68 * 2 = 1.36 integer part is 1
0.36 * 2 = 0.72 integer part is 0
0.72 * 2 = 1.44 integer part is 1
0.44 * 2 = 0.88 integer part is 0
Final answer = 0. 1 0 1 0....

Ques. Find the minimum-cost SOP and POS expressions for the function f(x1, x2, x3,
x4) =
summation m(4, 6, 8, 10, 11, 12, 15) + D(3, 5, 7, 9).

Representation of function using K-map and finding SOP and POS are as follows
SOP expression is
f = x1'x2 + x1x2' + x3x4 + x1x3'x4'
POS expression is
f = (x1 + x2)(x3 + x4')(x1' + x2' + x3' + x4)

Ques. Compare and contrast between lathes and flip flop

Latch is transparent � because input is directly connected to output when enable is
high, less area, less gates and faster.
Flip-flop is a pair of latches. Flip-flop is sensitive to pulse transition, more
area , more gates and slower.

Ques. Simplify the boolean expression A'(A + B) + (B + AA)(A + B')

A'(A + B) + (B + AA)(A + B') (Given expression)

A'A + A'B + (B + A)A + (B + A)B'(Idempotent (AA to A), then Distributive, used
twice)
A'B + (B + A)A + (B + A)B'
A'B + BA + AA + BB' + AB'
A'B + BA + A + AB'
Identity to remove BB)
A'B + AB + AT + AB'
step)
A'B + A(B + T + B')
A'B + A
A + A'B
A + A')(A + B)
A + B
(Complement, then Identity)
(Distributive, two places.)
(Idempotent (for the A's), then Complement and
(Commutative, Identity; setting up for the next
(Distributive)
(Identity)
(Commutative)
(Distributive)
(Complement, Identity)

Ques. Write characteristic equation of i) SR FF ii)JK FF iii) D FF and iv) T FF

i) Q(next)=S+R'Q
SR=0
ii) Q(next)=JQ'+K'Q
iii) Q(next)=D
iv)Q(next)=TQ'+T'Q

Ques. Exemplify state reduction problem

i) 2 sequential circuits may exhibit the same i/p o/p behavior but have a
different number of internal states in their state diagram.
ii) Certain properties of sequential circuits may simplify a design by reducing the
number of gates and flip-flops. Reducing the number of flip-flops reduces the cost
of a circuit.
iii) The reduction in the number of flip-flops in a sequential circuit is referred
to as the state reduction problem. State reduction algorithms are concerned with
procedures for reducing the number of states in a state table while keeping the
external i/p o/p requirements unchanged

Ques. Consider 3 variables x, y and z respectively. Enumerate possible maxterms for

3 variables boolean function.
x + y + z, x + y + z�, x + y� + z, x + y� + z�, x� + y + z, x� + y + z�, x� + y� +
z and x� + y� + z�.

Ques. Consider the following code snippet of combinational logic comprising of 4

Boolean variables x, y, a, b where x, a, b are inputs and y is the output.
f (x, y, a, b)
{
if (x is 1) y = a;
else y = b;
}
Which digital block is suitable for implementing above code snippet and why?

Multiplexer is suitable for the above code snippet because function can be
interpreted as having two inputs a, b and select signal x.
Output y will depend on the select signal x.

Ques. What is the largest negative number which can be stored 8 bit computer using
2�s complement?
The largest negative number is 1000 0000 = -128.