Scribd
Upload
18 views3 pages

Tutorial 2

The document contains 4 questions about simplifying Boolean algebra expressions and finding canonical forms from Karnaugh maps. Question 1 has 4 parts simplifying Boolean expressions. Question 2 finds canonical forms from truth tables. Question 3 and 4 use Karnaugh maps to minimize expressions in SOP and POS form. Question 5 describes logic circuits as Boolean expressions.

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
18 views3 pages

Tutorial 2

The document contains 4 questions about simplifying Boolean algebra expressions and finding canonical forms from Karnaugh maps. Question 1 has 4 parts simplifying Boolean expressions. Question 2 finds canonical forms from truth tables. Question 3 and 4 use Karnaugh maps to minimize expressions in SOP and POS form. Question 5 describes logic circuits as Boolean expressions.

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

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

You might also like