Scribd
Upload
36 views

Problems Chapter 8 Concepts

The document contains problems involving designing combinational logic circuits with multiple inputs and outputs using components like decoders, multiplexers, adders and other logic gates. The problems cover topics like deriving truth tables and Boolean expressions, designing priority encoders, multiplexers, adders and other common combinational circuits.

Uploaded by

Nguyen Huu Duc Tho
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
36 views

Problems Chapter 8 Concepts

The document contains problems involving designing combinational logic circuits with multiple inputs and outputs using components like decoders, multiplexers, adders and other logic gates. The problems cover topics like deriving truth tables and Boolean expressions, designing priority encoders, multiplexers, adders and other common combinational circuits.

Uploaded by

Nguyen Huu Duc Tho
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Problems Chapter 8 – Combinational circuits

1. Consider the combinational circuit shown in Fig.

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).
2. Obtain the simplified Boolean expressions for output F and G in terms of the input
variables in the circuit of Fig.

3. 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 even number.
4. Design a combinational circuit with three inputs, x, y, and z, and three outputs, A, B, and
C. When the binary input is 0, 1, 2, or 3, the binary output is one greater than the input.
When the binary input is 4, 5, 6, or 7, the binary output is two less than the input
5. A majority circuit is a combinational circuit whose output is equal to 1 if the input
variables have more 1’s than 0’s. The output is 0 otherwise. Design a 3-input majority
circuit by finding the circuit’s truth table, Boolean equation, and a logic diagram.
6. Design a four-bit combinational circuit 2’s complement. (The output generates the 2’s
complement of the input binary number.) Show that the circuit can be constructed
with exclusive-OR gates. Can you predict what the output functions are for a five-bit
2’s complement ?
7. Using four half-adders,
(a) Design a full-subtractor circuit incrementer. (A circuit that adds one to a four-bit
binary number.)
Chapter -8 – Pages-1
(b) Design a four-bit combinational decrementer (a circuit that subtracts 1 from a
fourbit binary number)
8. For a binary multiplier that multiplies two unsigned four-bit numbers, Using AND gates
and binary adders
9. Design a combinational circuit that compares two 4-bit numbers to check if they are
equal. The circuit output is equal to 1 if the two numbers are equal and 0 otherwise.
10. Design an excess-3-to-binary decoder using the unused combinations of the code as
don’t-care conditions.
11. Draw the logic diagram of a 2-to-4-line decoder using (a) NOR gates only and (b) NAND
gates only. Include an enable input
12. Design a BCD-to-decimal decoder using the unused combinations of the BCD code as
don’t-care conditions.
13. Construct a 5-to-32-line decoder with four 3-to-8-line decoders with enable and a 2-to-4-
line decoder. Use block diagrams for the components
14. Construct a 4-to-16-line decoder with five 2-to-4-line decoders with enable.
15. A combinational circuit is specified by the following three Boolean functions:
𝑭𝟏 (𝑨, 𝑩, 𝑪) = ∑(𝟏, 𝟒, 𝟔)
𝑭𝟐 (𝑨, 𝑩, 𝑪) = ∑(𝟑, 𝟓)
𝑭𝟑 (𝑨, 𝑩, 𝑪) = ∑(𝟐, 𝟒, 𝟔, 𝟕)
Implement the circuit with a decoder constructed with NAND gates and NAND or AND
gates connected to the decoder outputs. Use a block diagram for the decoder.
Minimize the number of inputs in the external gates.
16. Using a decoder and external gates, design the combinational circui defined by the
following three Boolean functions:
a. 𝑭𝟏 = 𝒙 ̅𝒚𝒛̅ + 𝒙𝒛 𝑭𝟐 = 𝒙 ̅𝒚𝒛̅ + ̅̅̅𝒚
𝒙 𝑭𝟑 = 𝒙̅ ̅𝒚𝒛̅ + 𝒙𝒚
b. 𝑭𝟏 = (𝒚 ̅̅̅ + 𝒙)𝒛 𝑭𝟐 = 𝒚 ̅𝒛̅ + 𝒙
̅𝒚 + 𝒚𝒛̅ 𝑭𝟑 = (𝒙 + 𝒚)𝒛
17. Design a four-input priority encoder with inputs as in Table 4.8 , but with input D0 having
the highest priority and input D3 the lowest priority.
18. Construct a 16x1 multiplexer with two 8x1 and one 2x1 multiplexers. Use block diagrams.
19. Implement the following Boolean function with a multiplexer.
(a) 𝑭(𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟎, 𝟐, 𝟓, 𝟖, 𝟏𝟎, 𝟏𝟒)
(b) 𝑭(𝑨, 𝑩, 𝑪, 𝑫) = ∏(𝟐, 𝟔, 𝟏𝟏)
20. Implement a full adder with two 4x1 multiplexers
21. An 8x1 multiplexer has inputs A, B, and C connected to the selection inputs S2, S1, and
S0, respectively. The data inputs I0 through I7 are as follows:
(a) I1= I2= I7= 0; I3= I5= 1; I0= I4= D; and I6= D’.
(b) I1 = I2 = 0; I3 = I7 = 1; I4 = I5 = D; and I0 = I6 = D’.
Determine the Boolean function that the multiplexer implements
22. Implement the following Boolean function with a 4x1 multiplexer and external gates.
(a) 𝑭𝟏 (𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟏, 𝟑, 𝟒, 𝟏𝟏, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒, 𝟏𝟓)
(b) 𝑭𝟐 (𝑨, 𝑩, 𝑪, 𝑫) = ∑(𝟏, 𝟐, 𝟓, 𝟕, 𝟖, 𝟏𝟎, 𝟏𝟏, 𝟏𝟑, 𝟏𝟓)
23.

Chapter -8 – Pages-2

You might also like