Assignment 1

Assignment 1 - CpE 412 Digital Logic Fall 2011 Missouri...

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

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

View Full Document

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.

Unformatted text preview: CpE 412: Digital Logic Fall 2011 Missouri S&T Assignment 1 Due Wednesday, August 31 Name: ________________________________________ Problem 1 1. Use Boolean Algebra rules to find the minimal form of the following expressions: (a) ¡ ¢ £¤ ¥¦§ ¨ ¢¦ ¨ ¤ ¥¦ ¨ ©¤¦ (b) ¡ ª« ¨ «¬­ª« § ¨ ¬­ ¨ ¬® 2. Show that the « ¯ ¬ gate is a functionally complete set. (Recall the « ¯ ¬ gate is described by the SOP form of ° ¡ ±² £ .) 3. Write the SOP canonical form of the logic function given by ª«³ ¬³ ®­ ¡ ´ µª¶³·³¸³¹³º­ . Problem 2 1. Diagram the CMOS implementation of the logic function ¡ ¢£ ¤ ¥ ¢£¦ § . 2. Diagram the CMOS implementation of a 3-input XOR gate. 3. Give one advantage of using CMOS instead of NMOS logic. Problem 3 1. Convert the binary number 111001011 to decimal using the iterative method. (That is, convert by dividing by 10 successively, keeping track of the remainders.) 2. Prove that a rational decimal number will have a rational binary representation. Explain how the fact that the decimal number .7 has a nonterminating binary representation does not contradict this claim. contradict this claim....
View Full Document

{[ snackBarMessage ]}

Page1 / 7

Assignment 1 - CpE 412 Digital Logic Fall 2011 Missouri...

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

View Full Document
Ask a homework question - tutors are online