CSC103 Homework 2 Solution 2013

From dftwiki3
Revision as of 13:05, 25 September 2013 by Thiebaut (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

--D. Thiebaut (talk) 10:39, 25 September 2013 (EDT)

Logic Design Problem (2 points)

The truth table was worth 1 point.

CSC103Homework2Prob1Sol.png

You had two options. One was to list all 11 terms corresponding to the 11 True symbols in the last column of the table, and or them together. The other was to take the expression directly from the diagram, which resulted in a much simpler formula.

The first method yielded (I'll list on the first and last of the 11 terms): 

f = ( NOT a AND NOT b AND NOT c AND NOT d ) OR ...   OR ( a AND b AND c and NOT d )

The second method yielded: 

f = NOT ( ( a AND b ) OR  (not c ) AND d )

The correct expression for f, which ever method was used was worth 1 point.

LOGIC SIMULATOR (3 points)

f =  ( ( NOT a ) AND b AND ( NOT c ) )
   OR ( a AND ( NOT b ) AND c )
   OR ( a AND b AND ( NOT c ) )
CSC103 HW2 2013 Circuit.png
















Retrieved from "http://dominiquethiebaut.com/dftwiki3/index.php?title=CSC103_Homework_2_Solution_2013&oldid=17854"