Electronic – Implementing logic expression and the truth table of logic function

boolean-algebracircuit analysisdigital-logiclogic-gates

enter image description here

(a) Expression for \$Z\$

\$Z=(B+\overline{C})A+B(C+\overline{D})+BD\$

\$Z=AB+A\overline{C}+BC+B\overline{D}+BD\$

\$Z=AB+\overline{A}C+B\$

\$Z=B+A\overline{C}\$

(b) Truth table

A B C || Z
==========
0 0 0 || 0
0 0 1 || 0
0 1 0 || 1
0 1 1 || 1
1 0 0 || 1
1 0 1 || 0
1 1 0 || 1
1 1 1 || 1

(c) Karnaugh Map

       | BC  00  01 11 10
 ------------------------
 A  0  |     0  1  1  1

    1  |     1  0  1  1

I was sure about what the last two questions (d) and (e) were asking me. Can anyone provide some guidance on how to solve these last two questions? Thank you in advance.

Best Answer

You have probably learned, that you can build every logic gate using NAND gates. This is often done, because NAND gates are easy to build.

In d), the task is to rebuild this circuit, only using NAND gates.

In e) the task is to find the critical (aka the longest) path in your circuit and calculate it's propagation delay, by using the given propagation delay of single gate.