Faculty of Engineering and Applied Sciences

DEPARTMENT OF MECHATRONICS ENGINEERING

Bachelor of Engineering in Mechatronics Engineering

COURSE: DIGITAL ELECTRONICS AND LOGIC DESIGN

Tutorial 2

Page | 1
Question 1

Using the laws of Boolean algebra, simplify the following Boolean expressions to a minimum
number of literals

a) (x + y’ + z)( x’ + z’)
b) (BC’ + A’D)( AB’ + CD)
c) (A’ + C)(A’ + C’)(A + B + C’D)
d) ABCD + A’BD + ABC’D

[4 marks]
Question 2

Find the canonical sum and canonical product of the Boolean functions T1 and T2 .

A B C T1 T2

0 0 0 1 0

0 0 1 1 0

0 1 0 1 0

0 1 1 0 1

1 0 0 0 1

1 0 1 0 1

1 1 0 0 1

1 1 1 0 1

[4 marks]

Question 3

Use a K map to simplify the expression A’B’C’ + AB’C + A’BC + ABC’ to a minimum SOP
form.
[4 marks]

Question 4

Use a K map to simplify the expression (A + B’ + C + D’)( A’ + B + C’ + D)(A’ + B’ + C’+D’)

to a minimum POS form
[4 marks]

Page | 2
Question 5

Write Boolean expressions of the circuits described by the following logic diagrams.

[4 marks]

Page | 3