1. Match the boolean expressions to their reduced forms

- I. II. III. IV.	A + A' B + B' C
- I. II. III. IV.	A' B C + A' B' C' + A B C' + A B' C
- I. II. III. IV.	(A B' C + ABC)(B + C')
- I. II. III. IV.	(A B C + A B' C)'

I.	A XOR B XOR C
II.	ABC
III.	A' + C'
IV.	A + B + C

2. A function is implemented with minimal SOP F(A,B,C,D) = BD + A'CD' Does this circuit have a potential static-1 hazard

Yes

No

3.

Which of the following KMAPs reduces to a minimal sop F(A,B,C,D) = A' D + ABC

AB\CD	00	01	11	10
00		1	1
01		1	1
11			1	1
10

AB\CD	00	01	11	10
00			1	1
01			1	1
11			1	1
10

AB\CD	00	01	11	10
00		1	1
01		1	1
11	1	1
10

AB\CD	00	01	11	10
00		1	1	1
01		1	1	1
11			1	1
10

Which of the following KMAPs reduces to a minimal POS F(A,B,C,D) = (A + D)(A' + B)(A' + C')

AB\CD	00	01	11	10
00		1	1
01		1	1
11			1	1
10

AB\CD	00	01	11	10
00			1	1
01			1	1
11			1	1
10

AB\CD	00	01	11	10
00		1	1
01		1	1
11	1	1
10

AB\CD	00	01	11	10
00		1	1	1
01		1	1	1
11			1	1
10

What is the minimum number gates needed to replicate the behavior of the circuit below using ONLY 2-input NAND gates: (ASSUME SINGLE-RAIL Inputs) Your answer should be a number.