csse232_hw0_soln

# csse232_hw0_soln - Fall 2009-2010 CSSE 232 CSSE 232...

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

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: Fall 2009-2010 CSSE 232 CSSE 232 Computer Architecture I Rose-Hulman Institute of Technology Computer Science and Software Engineering Department Homework 0 Solutions Combinational Logic 1. (4 points) Design a digital logic circuit that implements the 4-input Boolean function described by the truth table below. You may use three inverters to complement the inputs and up to four other gates. x x 1 x 2 x 3 f( x , x 1 , x 2 , x 3 ) 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 The Karnaugh map for this truth table is: 00 01 11 10 00 01 11 10 0 0 0 0 0 1 1 1 1 1 1 x x 1 x 2 x 3 20 October 2009 Page 1 Fall 2009-2010 CSSE 232 Which yields a boolean expression of F = x x 1 + x x 2 x 3 + x 1 x 2 x 3 and the follwing combinational logic circuit. x x 1 x 2 f x 3 2. (4 points) Explain why each of the following statements about full adders is false. The inputs are A, B, and C i and the outputs are O and C o . (a) O is true if and only if exactly one of the inputs is 1. (b) C o is true if and only if exactly two of the inputs are 1. The truth table for a full adder is: A B C i O C o 1 1 1 1 1 1 1 1 1 1 1 1 1 1 The last line of the truth table makes both statements are false....
View Full Document

## This note was uploaded on 12/04/2009 for the course ECE 471 taught by Professor Someprofessor during the Spring '09 term at Cornell University (Engineering School).

### Page1 / 7

csse232_hw0_soln - Fall 2009-2010 CSSE 232 CSSE 232...

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

View Full Document
Ask a homework question - tutors are online