{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

HW1_Solutions

# HW1_Solutions - each of the three cases Note added The...

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

Due Sept 11, 2009 . Submit file using RAMCT. No need to give intermediate steps. However please ensure that we can identify the answers clearly. 1. Convert the following into unsigned binary. 6, 27, 63, 64, 65 ANSWER : 110, 11011, 111111, 1000000, 1000001 2. Convert the following into signed 2.s comp. binary numbers. Use 8 bits. 6, -27, 63, -64, 65 ANSWER : 0000 0110, 1110 0101, 0011 1111, 1100 0000, 0100 0001 3. Convert the following signed binary numbers into decimal. 1011 1111, 1011 1110, 0100 0011, 1111 1110 ANSWER : -65, -66, 67, -2 4. Add the two binary numbers (3 pairs) . Verify the results by converting all numbers into decimal in

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: each of the three cases. Note added: The numbers are signed. 1) 0100 0001 (65) + 1111 1110 (-2) ANSWER : 0011 1111 (63) 2) 0100 0001 (65) + 0100 0001 (65) ANSWER : 1000 0010 (-126) OVERFLOW. Cannot represent a number greater than 127 using 8 bits. 3) 0100 0000 (64) + 1011 1111 (-65) ANSWER : 1111 1111 (-1) 5. Perform the bit-wise AND and bit-wise OR of these binary strings. 1011 1111 1011 1111 AND OR 0100 0011 0100 0011 ANSWER : 0000 0011 1111 1111 5. What is the largest signed positive number you can represent using 8 bits? ANSWER : 127...
View Full Document

{[ snackBarMessage ]}

### Page1 / 3

HW1_Solutions - each of the three cases Note added The...

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

View Full Document
Ask a homework question - tutors are online