# Studio_2sol - -5 11011 12 01100 g-3-7 =-10 11101...

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

1) a) In 6 bit 2's complement, we can represent numbers from -32 to +31 (both inclusive) hence (b), (d), (f) cannot be represented. b) 0000 = 0 0001 = 1 0010 = 2 0100 = 4 1000 = -8 1100 = -4 1110 = -2 1111 = -1 c) taking two's complement is the same as negating the numbers. the 2's complements of the numbers are 0000 1111 1110 1100 1000 0100 0010 0001 d) the decimal values for the binary interpretation of the numbers are: 0, 1, 2, 4, 8, 12, 14, 15 e) hex representation 0 1 2 4 8 C E F f) -3: 11101 -7: 11001 -1: 11111 1 : 00001 5 : 00101 -12: 10100

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: -5 : 11011 12: 01100 g)-3-7 = -10 11101 +11001-------10110 (-10)-1+1 = 0 11111 +00001-------00000 5-12 = -7 00101 +10100--------11001 (-7)-5+12 = 7 11011 +01100-------00111 (7) h) 10011 10111 10001 00001 00101 11100 10101 01100 2) Straightforward gate implementation in LogicWorks 4) It is seen that B and D have identical truth tables. X Y Z | A B C D 0 0 0 | 1 1 0 1 0 0 1 | 1 1 1 1 0 1 0 | 1 0 0 0 1 0 0 | 1 0 0 0 1 1 0 | 0 0 0 0 1 0 1 | 1 1 0 1 0 1 1 | 1 0 1 0 1 1 1 | 0 1 0 1...
View Full Document

## This homework help was uploaded on 04/22/2008 for the course ECSE 2610 taught by Professor Ji during the Spring '08 term at Rensselaer Polytechnic Institute.

### Page1 / 2

Studio_2sol - -5 11011 12 01100 g-3-7 =-10 11101...

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

View Full Document
Ask a homework question - tutors are online