# HW#6 - for each of the Boolean expressions in problem 1...

This preview shows page 1. Sign up to view the full content.

King Fahd University of Petroleum and Minerals Department of Electrical Engineering EE 200 Digital Logic Circuit Design Dr. H. Ragheb HW No. 6 1- Using algebraic manipulations, obtain a logic diagram consisting of only NAND-gates for each of the following expressions. Assume the variables are available both complemented and uncomplemented. (a) z x w x w y z y x w f + + = ) , , , ( (b) ) )( )( ( ) , , , ( y x w z x y w z y x w f + + + + = (c) ) ( ) ( ) , , , ( y x z y x y x w z y x w f + + + = (d) )] )( ( )[ ( ) , , , ( z y z y w z y x z y x w f + + + + = 2- Using algebraic manipulations, obtain a logic diagram consisting of only NOR-gates
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: for each of the Boolean expressions in problem 1. Assume the variables are available both complemented and uncomplemented. 3-Convert the logic diagram shown below into a logic diagram consisting of: (a) only NAND gates (b) only NOR gates. 4- Implement the following expression using XOR and AND gates D C B A D C B A D BC A D C B A F + + + =...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online