Description
Most of my questions is multiple choices and the other one is short answer the book we use is digital system principle and application for the last question on the second picture I will s
Unformatted Attachment Preview
Purchase answer to see full attachment
Explanation & Answer
Attached.
HW – Karnaugh Maps
1. Reduce the following SOP to minimum form using the Karnaugh mapping method.
Z= A’ + AB + BC + B’C
A
0
0
0
0
1
1
1
1
B
0
0
1
1
0
0
1
1
C
0
1
0
1
0
1
0
1
A’
1
1
1
1
0
0
0
0
AB
0
0
0
0
0
0
1
1
BC
0
0
0
1
0
0
0
1
A
B’C
0
0
0
0
1
0
0
0
Z
1
1
1
1
1
0
1
1
A
BC 00
01
11
10
0 1
1
1
1
1 1
0
1
1
B
Z= A’
2. X’= A’B’C’ + A’B’C + A’BC’ + ABC’
A
0
0
0
0
1
1
1
1
B
0
0
1
1
0
0
1
1
C
0
1
0
1
0
1
0
1
X’=
A’B’C’
1
0
0
0
0
0
0
0
A’B’C
0
1
0
0
0
0
0
0
A’BC’
0
0
1
0
0
0
0
0
ABC’
0
0
0
0
0
0
1
0
X’
1
1
1
0
0
0
1
0
A
A
BC 00
01
10
0A’
1A
B
11
Write the following Boolean expression in a sum of products (SOP) form: (A + B). (C +D)
Using AND, OR and Inverter logic gates, sketch a circuit for A’ (B + C’) +D...