CSE140 Midterm1_Solution

CSE140 Midterm1_Solution - CSE140 Midterm 1, October 14,...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
1 CSE140 Midterm 1, October 14, 2010, Name___________________________ PID ----------------------------- (I) (15pts) (Problem Formulation and Canonical Expression) A full adder inputs three bits ( a , b , cin ) and outputs the sum bit and carry bit ( s , cout ). Write the truth table of the full adder and the corresponding canonical product-of- maxterms expressions. A B Cin S Cout 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 1 1 1 1 1 S = (a + b + cin)(a + b' + cin')(a' + b + cin')(a' + b' + cin) Cout = (a + b + c)(a' + b + cin)(a + b' + cin)(a + b + cin')
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 (II) (10pts) (Laws and Theorems of Boolean Algebra) Specify the axioms or theorems for each step. Prove using Boolean algebra that a b + a’c’ + b’c’ = a’b + b’c’ . a’b + a’c’ +b’c’ = a’b + a’c’(b+b’) + b’c’ (complementarity) = a’b + a’c’b + a’c’b’ + b’c’ (distributivity) = a’b + b’c’ (Absorptio n of the first two and last two terms) Can also use Consensus directly to prove the result.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 9

CSE140 Midterm1_Solution - CSE140 Midterm 1, October 14,...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online