f99 - MAD 2104 Final Exam April 21, 1999 Prof. S. Hudson...

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

View Full Document Right Arrow Icon
MAD 2104 April 21, 1999 Final Exam Prof. S. Hudson Name Try to answer the questions in the space provided. If you continue your work elsewhere, be sure to leave a note. Do not use a calculator, book, or any personal paper. You may ask about any ambiguous questions or for extra paper. If you use extra paper, be sure to hand it in with your exam. 1) A. (8 pts) Use a Karnaugh map to simplify the Boolean expression xyz + x ¯ yz + ¯ xyz + ¯ x ¯ yz + ¯ x ¯ y ¯ z . [Or, for a little extra credit, you can use the Quine McCluskey method instead (maximum 10 pts). But don’t do both]. B. (7 pts) Design a circuit (using AND, OR, NOT gates) to implement the simplified F above. [If you can’t do part A, use F = x ¯ z + ¯ yz instead of the answer to A]. 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
F ( x,y,z ) = 1 unless exactly two of the variables x,y and z are 1 (for example, F (0 , 1 , 1) = 0). Use a table to express F in sum-of-minterm form. 3) (5 pt) Perform a postorder traversal of the tree
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.

This note was uploaded on 12/27/2011 for the course MAD 2104 taught by Professor Staff during the Fall '08 term at FIU.

Page1 / 5

f99 - MAD 2104 Final Exam April 21, 1999 Prof. S. Hudson...

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