Quiz submission record for quiz4-1-1 at Mon Jul 12 08:53:34 2004:

Your Answer for Question 1:
For canonical sum-of-products representation, for every term, there must be a one in the output.  In order for the maximum number of terms, the truth table should OR together all the N inputs, so that only when all of inputs are 0, is there no term in the canonical sum-of-products. Ex:
0 0 0 | 0
0 0 1 | 1
0 1 0 | 1      Answer:
0 1 1 | 1          (2^N)-1; where N=number of inputs
1 0 0 | 1
1 0 1 | 1
1 1 0 | 1
1 1 1 | 1

Your Answer for Question 2:
a bus is a collection of wires. each wire represents a bit.  so a bus is like word, holding a different value with each clock cycle.

Your Answer for Question 3:
y=a.a+a.b+a.not(b)
y=a+a.b+a.not(b)            idempotent law
y=a.b+a+a.not(b)            commutativity
y=a.b+a.not(b)+a            commutativity
y=a.b+a                           uniting theorem
y=a                                  uniting theorem



Your unique submission ID is quiz4-1-1-cs61c-av-1089647614-2992.