Question

(c) (d) (€ у с olo ° -oom 1 0 0 0 0 1 1 0 0 0 0 0 Olонон онон 1 оооо 1 1 1 оо 1 0 0 1 1 1 1 1 1 1 О онопононопононо 0 1 на онно онаа онооооо 1 ооос 1 1 1 1 1 1 1 Но она

1) minimize each of the boolean equations from the pic.

2) sketch a reasonably simple combinational circuit implementing each of the functions from the pic provided

Answer 1

Here, We can minimize the above two truth table using the K-map. From K-map we can obtain the minimal function of the truth table and that function can be implemented using the AND, OR, and NOT gate.

Please see the below image for the C) truth table and it's minimal expression realization using the logic gates.

Minimal Function, F = A'B'C + AB

A B Y A Be 0001 IL TO 1 1 1 o 1 1 1. 0 O function = A'B'C + AB o 1 o I 7 o 1 III 1 Here, we have implemented the sum of the Product term. " If we consider A, B, C Input & Implement the function using AND ,OR , Not crate. & Not arate. & d. prput gate. AND-operation A' AB A A'B'c B! A B C + AB -Do B С AB OR Implementerian - Here, we assume gate fun-in (no of input) is a The above cirenit is Implementation of the function = A'B'C + AB

Please see the below image for the D) truth table and it's minimal expression realization using the logic gates.

Minimal Expression F = B'D' + A'C

di A с alo HIK so AB 11 1 I 1 1 1 1 1 I o 10.l1 O I 1 0 o 1 Here, a group of 4 4.4 is formed so, a ferms is there. 0 1 1 1 1 0 o I fumetion - B'D' + A'd 1. o 1 1 O 1 1 0 1 1 o 1 lo tu 1 4 1 can Implement the the function using Here we AND, OR & Not Implementation B! Da Blo! B'D'+ Alc D DO A A Do C the output & Here the above cirenit is produce Same above table. as