Bsc CSIT Semester 1 – Digital Logic – Unit 3: Simplification of Boolean Functions (5 Hrs.)

Simplify F(A,B,C,D) = Π(1,3,4,6,9,11,12,14) and realize the equation using NOR gates only.

If f(P,Q,R,S)= Σ (3,4,7,8,14) and d(P,Q,R,S)= Σ(1,6,9,13). Simplify it using K-map and design circuit using minimum number of NAND gates.

Express the Boolean function F = x + yz as product of max-terms.

Minimize the Boolean function Boolean function using K-map

F(A, B, C, D) = Σ(0, 1, 3, 5, 7, 8, 9, 11, 13, 15)

Write Short notes on (Any two)

$\quad$ a. RTL

$\quad$ b. State Reduction

$\quad$ c. POS

Express the complement of the following function in sum of min-terms. F(A, B, C, D) = Σ(0, 2, 6, 11, 13, 14)

Reduce the following function using k-map F = wxy + yz + xy’z + x’y

Express the Boolean Function F = A + B’ C in a sum of min terms .

Reduce the following function using k-map F = B’D + A’BC’ + AB’C + ABC’