C D B A B X: KIE1003 Digital System Tutorial 2

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

KIE1003 Digital System

Tutorial 2

1. Develop the Boolean expression for the output of each gate network.
a)
C
D
X
B
A
B

b)
A
B X
A
C
D

2. Write the Boolean expression for the output of circuit in Figure 1. Use the expression to
determine the complete truth table. Then apply the waveforms of Figure 2 to the circuit
inputs, and sketch the resulting output waveform.

B X

C
Figure 1

Figure 2

2. Simplify the following expressions using Boolean and de Morgan’s theorems.


a) A( B  C ) D
b) ABCD
c) A( A  B)

1
d) AB  ( A  B)C
e) ABC[ AB  C ( BC  AC )]

3. Convert the following expressions into canonical SOP form.


a) f ( A, B, C )  ( A  C )( AB  AC )
b) f ( A, B, C, D)  AB  CD( AB  CD)

4. Given the function f ( A, B, C, D)  A B C D  A B CD  ABC D  ABCD , express the


functions f(A,B,C,D) and f ( A, B, C, D) in minterm compact form.

5. Given the function f ( A, B, C )  ( A  B  C )( A  B  C )( A  B  C )( A  B  C ) , construct


the truth table and express the function in both maxterm and minterm compact forms.

You might also like