Scribd
Upload
41 views1 page

Quiz 2-2 Logic

This document contains a quiz for a digital logic design course. It has 5 questions related to simplifying logic functions using Karnaugh maps, implementing decoders and multiplexers to create logic gates, and determining the outputs of logic circuits as functions of the inputs.

Uploaded by

Fysal Khan
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
41 views1 page

Quiz 2-2 Logic

This document contains a quiz for a digital logic design course. It has 5 questions related to simplifying logic functions using Karnaugh maps, implementing decoders and multiplexers to create logic gates, and determining the outputs of logic circuits as functions of the inputs.

Uploaded by

Fysal Khan
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
You are on page 1/ 1

Digital Logic Design – ENCE 2301 ADA University

Quiz 2-2
Date: 19.03.2021

1. Simplify the following functions F and G


by using Karnaugh maps:

2. A) Implement 3x8 Decoder by using 2x4 Decoders with enable inputs. You can give
constant inputs to some terminals.
B) Build 4 input OR gate by using 2x1 MUX’s only.
C) By using your designs in part A and B implement 3 input XOR gate by using 2x4 Decoders
and 2x1 Mux’s only.

3. A) Function 𝐹(𝑎, 𝑏, 𝑐) is given as sum of minterms in your ID. If ID has 8 or 9 take them as
0 and 1, respectively. For example, if ID is 7438 then 𝐹(𝑎, 𝑏, 𝑐) = ∑(0, 3, 4, 7). Implement
𝐹 by using a single 2x1 multiplexer and some gates.
B) Now implement F by using three 2x1 MUX’s only. Complement of input variables are
available.

4. Function 𝐹(𝑎, 𝑏, 𝑐, 𝑑 ) = ∑(0, 1, 2, 13, 14, 15). Take digits of your ID and add 3 to each of
them. These are don’t care minterms. For example, if ID=7439, then 𝑑(𝑎, 𝑏, 𝑐, 𝑑 ) =
∑(6, 7, 10, 12). Bu using Karnaugh maps find sum-of-products and product-of-sums
minimal forms. Implement F with NAND gates only. Then implement F by using NAND-
AND implementation.

5. For the two different circuits below find the outputs 𝐹 and 𝐺 as functions of the inputs
𝑎, 𝑏 and 𝑐. Simplify them if possible.

You might also like