CSCI 255 Homework 2

Problem 1 and only

There are three ways of representing combinational digital logic: (1) a Boolean equation, (2) a truth table, and (3) an acyclic logic circuit.

Below are example of each of these three representations. Translate each representation into the other two.

1. X' + Y Z' + (Y + Z) Y'

2. X	Y	Z	out
   0	0	0	0
   0	0	1	1
   0	1	0	1
   0	1	1	1
   1	0	0	1
   1	0	1	0
   1	1	0	0
   1	1	1	1

3.