Scribd
Upload
196 views3 pages

Problem Set #4: Combinational Logic Circuits

This document contains an assignment for a logic design and digital circuits course. It includes 8 problems related to designing and analyzing combinational logic circuits. The problems involve evaluating circuit outputs given inputs, deriving boolean expressions, creating truth tables, simplifying functions using K-maps, and designing circuits to perform tasks such as comparing numbers, incrementing/decrementing values, and converting between coding schemes.

Uploaded by

AhmedGamal
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
196 views3 pages

Problem Set #4: Combinational Logic Circuits

This document contains an assignment for a logic design and digital circuits course. It includes 8 problems related to designing and analyzing combinational logic circuits. The problems involve evaluating circuit outputs given inputs, deriving boolean expressions, creating truth tables, simplifying functions using K-maps, and designing circuits to perform tasks such as comparing numbers, incrementing/decrementing values, and converting between coding schemes.

Uploaded by

AhmedGamal
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/ 3

Department of Electrical Engineering

ELE 215 – Logic Design and Digital Circuits


Spring 2018
Lem set

Problem set #4 Combinational Logic Circuits

1. Consider the combinational circuit shown in Fig. 1.


(a) Evaluate the outputs w, x, y, and z as a function of the four inputs.
(b) List the truth table with 16 binary combinations of the four input variables. Then list the
binary values for the outputs w, x, y, and z in the table.

Fig. 1

2. Consider the combinational circuit shown in Fig. 2.


(a) Derive the Boolean expressions for T1 through T3. Evaluate the outputs F1 and F2 as a
function of the three inputs.
(b) List the truth table with 8 binary combinations of the three input variables. Then list the
binary values for T1 through T3 and outputs F1, F2, and F'2 in the table.

Problem Set #4 Page 1 of 3 ELE 215


(c) Simplify F1, and F2 from truth table in part (b) using the k-map and then plot the output
Boolean functions obtained using the k-maps.
(d) Compare the results in part (c) with the circuit in Fig. 2.

3. Consider the combinational circuit shown in Fig. 3.


(a) Derive the Boolean expressions for T1 through T4. Evaluate the outputs F1 and F2 as a
function of the four inputs.
(b) List the truth table with 16 binary combinations of the four input variables. Then list the
binary values for T1 through T4 and outputs F1 and F2 in the table.
(c) Plot the output Boolean functions obtained in part (b) on maps and show that the
simplified Boolean expressions are equivalent to the ones obtained in part (a).

Problem Set #4 Page 2 of 3 ELE 215


Fig. 3

4. Design a combinational circuit with three inputs and one output.


a) The output is 1 when the binary value of the inputs is less than 3. The output is 0
otherwise.
b) The output is 1 when the binary value of the inputs is an odd number.

5. Design a combinational circuit that generates the 9th complement of a BCD digit.

6. Design a combinational circuit that converts a four-bit Gray code to a four-bit binary
number.

7. Design a combinational circuit that compares two four-bit numbers to check if they are
equal or not. The output is 1 if the two numbers are equal and 0 otherwise.
8. Using adders to:
a) Design a four-bit combinational circuit incrementer (adds 1 to four-bit binary number)
b) Design a four-bit combinational circuit decrementer (subtracts 1 from four-bit binary
number).

Problem Set #4 Page 3 of 3 ELE 215

You might also like