Scribd
Upload
34 views1 page

Digital Logic Sample Question

The document outlines a series of tasks related to simplifying Boolean functions through various methods including truth tables, Karnaugh Maps, and prime implicants. It includes specific functions for simplification and implementation using different gate configurations. Additionally, it provides instructions for constructing circuits using NAND and NOR gates, as well as XOR and AND gates.

Uploaded by

Oktay vosoughi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views1 page

Digital Logic Sample Question

The document outlines a series of tasks related to simplifying Boolean functions through various methods including truth tables, Karnaugh Maps, and prime implicants. It includes specific functions for simplification and implementation using different gate configurations. Additionally, it provides instructions for constructing circuits using NAND and NOR gates, as well as XOR and AND gates.

Uploaded by

Oktay vosoughi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Due date : November 11th, 2022 – 9:00am

For the Boolean functions in Q1) to Q2) you are going to find a simplified Product of Sums expression using the
following steps:

(a) Construct the truth table.

(b) Write the function as a product of maxterms.

(c) Draw the Karnaugh Map.

(d) Write down all prime implicants for F'.

(e) Mark essential prime implicants. Indicate the minterm(s) that make them essential.

(f) Find a simplified POS expression for F using prime implicants (F = (F')').

(g) Calculate literal cost (L) and gate input cost (G).

(h) Implement using AND, OR gates.

(i) Implement using two-level NOR gates.

Q1) F (w, x, y, z) = (w' + x + z)( w' + x' + y)(w' + x' + y)(x' + y + z)

Q2) F (x, y, z) = (x  y) z + x y

For the Boolean functions in Q3) to Q4)

(a) Draw the Karnaugh Map.

(b) Write down all prime implicants for F.

(c) Mark essential prime implicants. Indicate the minterm(s) that make them essential.

(d) Find a simplified SOP expression for F using prime implicants.

(e) Calculate literal cost (L) and gate input cost (G).

(f) Implement using AND, OR gates.

(g) Implement using two-level NAND gates.

Q3) F (w, x, y, z) = (5, 6, 7, 12, 14) + d(3, 9, 11, 15)

Q4) F (w, x, y, z) = (0, 6, 8, 13, 15) + d(2, 4, 10)

Q5) Draw a multiple-level NAND circuit for the function F(v, w, x, y, z) = y z (x + y) w + (x y' + z v').

Q6) Draw a multiple-level NOR circuit for the function F(A, B, C, D) = A (B + C + D) + B C D.

Q7) Implement the following Boolean function with XOR and AND gates

F(w, x, y, z) = w x'y z' + w'x y z' + w x'y'z + w'x y'z

You might also like