Quiz submission record for quiz4-1-1 at Sun Jul 11 22:29:41 2004:

Your Answer for Question 1:
The maximum number of terms in the function's canonical sum-of-products representation is 2^n.

Your Answer for Question 2:
A bus is a shared communication link, which uses one set of wires to connect multiple subsystems.

Your Answer for Question 3:
y = a.a + a.b + a.not(b)
y = a + a.b + a.not(b) (Definition of AND, since a AND a only equals 1 if a = 1 and 0 otherwise, saying a AND a is equivalent to just using a since whatever a's value is would be the same as the result of a AND a (either you have 1 AND 1 or 0 AND 0).
y = (a + a) . (a + b) + a.not(b) (Distributive law)
y = a . (a + b) + a.not(b) (Definition of OR, again, since a OR a is equivalent just a itself, can reduce)
y = (a + b) . a + a.not(b) (Commutative law)
y = (a + b) . (a + a) . (a + not(b)) (Distributive law)
y = (a + b) . a . (a + not(b)) (Definition of OR)
y = a . (a + b) . (a + not(b)) (Commutative law)
y = a . 0 (Inverse laws)


Your unique submission ID is quiz4-1-1-cs61c-ev-1089610181-2874.