Scribd
Upload
9 views

Tutorial 3

The document discusses logic design and switching circuits. It contains 4 questions about combinational logic circuits including truth tables, K-maps, multiplexers, decoders, encoders, and comparators. Circuits are to be designed using components like multiplexers, decoders, and gates.

Uploaded by

brendonsithole6
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
9 views

Tutorial 3

The document discusses logic design and switching circuits. It contains 4 questions about combinational logic circuits including truth tables, K-maps, multiplexers, decoders, encoders, and comparators. Circuits are to be designed using components like multiplexers, decoders, and gates.

Uploaded by

brendonsithole6
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/ 4

Faculty of Engineering and Applied Sciences

DEPARTMENT OF INFORMATION TECHNOLOGY


Bachelor of Science Honours Degree in Business Computing
Bachelor of Science Honours Degree in Information Technology

ASSIGNMENT 3

COURSE: LOGIC DESIGN AND SWITCHING CIRCUITS

Page | 1
QUESTION 1

A combinational circuit has three inputs (C, I1, I0) and two outputs
(O1, O0).

The function implemented by F is the following: If C = 0, then O1O0


becomes I1I0. If C = 1, then O1O0 becomes (I1I0)+1. For example, if
C = 1 and I1I0 is 01, O1O0 becomes 10. Note that if I1I0 is 11 and
C = 1, then the output value wraps around 00, without any overflow.

a) Fill the Truth Table.

C I1 I0 O1 O0
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

[2 Marks]
b) Write the Boolean expression for O1 and O0 in sum of minterms
form. [2 Marks]

c) Using K-Maps for O1 and O0, find the Boolean expression for the
minimum sum of products implementation. [4 Marks]

Page | 2
QUESTION 2

Design a 32-to-1 multiplexer using only 8-to-1 multiplexer. Use block


diagram for the components. [4 Marks]

Implement a full adder circuit using 4:1 multiplexers. [4 Marks]

QUESTION 3

A combinatorial circuit is defined by the following three Boolean


functions:

= ̅̅̅̅̅̅̅̅

= ̅̅̅̅̅̅̅̅ ̅

= ̅ ̅̅̅̅̅̅̅̅

Design a circuit with a single decoder and external OR gates.


[6 Marks]

The 1-bit full subtractor shown in the following figure performs the
binary subtraction
Where P and Q are 1-bit variables and is borrow input from the
previous stage. It produces two outputs: the difference D and the
borrow output . The truth table describing the function of this 1-
bit full subtractor is shown in table.

Do the following:
a) Derive the simplified Boolean expressions for D and using K-map.
[4 Marks]

Page | 3
b) Design the 1-bit full subtractor using 3x8 decoder. [4 Marks]

QUESTION 4

Explain the function of an encoder. Implement an 8-to-3 line


encoder using gates. [6 Marks]

Explain the function of a Priority Encoder? [2 Marks]

Explain the function of a comparator? [2 Marks]

Page | 4

You might also like