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
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 bitwise AND and bitwise 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
This note was uploaded on 12/16/2009 for the course CS 123456 taught by Professor Yashwant during the Spring '09 term at Colorado State.
 Spring '09
 Yashwant

Click to edit the document details