An Introduction to Boolean Proofs

# An Introduction to Boolean Proofs - Mallard ECE 290:...

This preview shows pages 1–2. Sign up to view the full content.

Mallard ECE 290: Computer Engineering I - Spring 2007 - Graded Web. .. https://mallard.cites.uiuc.edu/ECE290/webgrade.cgi?SessionID=mding3. .. 1 of 3 1/26/2007 1:47 AM Graded WebQuiz: An Introduction to Boolean Proofs You have submitted this WebQuiz 1 time (including this time). You may submit this WebQuiz a total of 10 times and receive full credit. When you give a boolean proof, you must show every use of every property. Note, however, that commutative and associative properties can be used freely. Warning: There are new questions in this quiz. If you find an error or ambiguity, post on webboard the question you are seeing (e.g. a+b(c+d)) and then move on to another quiz. Question #1 To simplify [ w'(x + w) (x' + z) 0 + y' ]' what property should be used first? null (x+1=1 ; x0=0) You received a raw score of 100% on this question. Question #2 Distributive Property usage: Put the following expression into minimal sum-of-products (SOP) form. Specify the fewest number of steps needed and the number of distributive property uses. (a + b) (c + d) =

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 06/21/2011 for the course ECE 290 taught by Professor Staff during the Spring '08 term at University of Illinois, Urbana Champaign.

### Page1 / 3

An Introduction to Boolean Proofs - Mallard ECE 290:...

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

View Full Document
Ask a homework question - tutors are online