Scribd
Upload
28 views2 pages

Problem Set 3 - Mo23

Uploaded by

cool cube master chirayu
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
28 views2 pages

Problem Set 3 - Mo23

Uploaded by

cool cube master chirayu
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/ 2

EED 206 DIGITAL ELECTRONICS MONSOON 2023

Problem Set 3
To be discussed in the tutorials scheduled on Friday, September 8

1. For the Boolean function

(a) Obtain the truth table of F.


(b) Draw the logic diagram, using the original Boolean expression.
(c) Use Boolean algebra to simplify the function to a minimum number of literals.
(d) Obtain the truth table of the function from the simplified expression and show
that it is the same as the one in part (a).
(e) Draw the logic diagram from the simplified expression, and compare the total
number of gates with the diagram of part (b).

2. Implement the following function as a SOP form using NAND Gates only. Implement POS form
using NOR gates only.

Express the above function as a sum of minterms (SOP) and as a product of maxterms (POS).

3. Convert each of the following to the other canonical form:


(a) F(x, y, z) = ∑ (2, 5, 6)
(b) F(A, B, C, D) = ∏ (0, 1, 2, 4, 7, 9, 12)

4. Convert the following expressions into sum of products and product of sums:

5. Write Boolean expressions and construct the truth tables describing the outputs of the
circuits described by the logic diagram in figure 1.

Figure 1
6. A combinational circuit has to be designed for performing the operation Z = (X + 1)Y + 2, where
both X and Y are positive integers in the range 0-3 and are represented by 2-bit binary codes X1X0
and Y1Y0 respectively. Z is represented by the four-bit binary code Z3Z2Z1Z0. Construct a truth table
for the 4 output bits Z3, Z2, Z1, Z0.

7. An intelligence agency uses a special code for storing numerical data for the sake of data
security, representing each 4-bit number (N) by a 4-bit binary code PQRS according to the
following scheme:
For 4 ≥ N ≥ 0, PQRS = 13 – N, e.g. if N = 2, PQRS = 1011,
for 11 ≥ N ≥ 5, PQRS = N – 3, e.g. if N = 6, PQRS = 0011,
for 13 ≥N ≥ 12, PQRS = N + 2, e.g. if N = 12, PQRS = 1110, and
for 15 ≥ N ≥14, PQRS = 15 – N, e.g. if N = 15, PQRS = 0000.
A Decoder has to be designed for obtaining the normal binary representation B3B2B1B0 of N from
its PQRS representation. Construct the truth table for the 4 bits B3, B2, B1, B0.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy