hw4 - CSCI 120 Introduction to Computation Homework 4 Due...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CSCI 120 Introduction to Computation Homework 4 Due 03/26/09 Saad Mneimneh Visiting Professor Hunter College of CUNY PART 1: Binary System (a) Find the decimal representation of each of the following bytes: 01010111 01101000 01100001 01110100 00100000 01100100 01101111 01100101 01110011 00100000 01101001 01110100 00100000 01110011 01100001 01111001 00111111 (b) Assuming the above message is encoded in ASCII (read about ASCII in the notes), what does it say? (you may search the Internet for ASCII code). (c) Convert each of the following numbers to binary using either the coin algo- rithm or the repeated division algorithm: 7 11 16 15 33 PART 2: Addition and overflow (a) Recall that when adding two numbers, an overflow can occur if the result is outside the range of what can be represented. For example, with a 4 bit twos complement representation, we can only represent the numbers from -8 to 7. Adding 5 and 6 will cause an overflow and, therefore, produce the wrong result (note that overflow does not mean carry). Among the following additions,result (note that overflow does not mean carry)....
View Full Document

This note was uploaded on 03/27/2010 for the course CSCI 120 taught by Professor Saadmneimneh during the Spring '09 term at CUNY Hunter.

Page1 / 3

hw4 - CSCI 120 Introduction to Computation Homework 4 Due...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online