SFU - CMPT 150 - Assignments - 4

SFU - CMPT 150 - Assignments - 4 - c A.H.Dixon CMPT 150 :...

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: c A.H.Dixon CMPT 150 : Assignment 4 1 Due 23:59 Wednesday, March 19, 2008 (2 pages) NOTE: Before you prepare your final submission, please access the course web- site and check the Submissions link for information on how to present your solutions and what to submit for marking. You are responsible for having read these guidelines and marks may be deducted for not following them. In any programming language, in order to display a result on a workstation in a form readable to humans, that result must be expressed as a sequence of characters. For example, a computation might produce the result: 0 1 0 0 1 1 0 0 Now if it is known that this is the base-2 representation of an integer, then it must be converted to the character string 76 because that is the what the base-2 number given by the binary sequence 01001100 represents. Therefore every programming language in- cludes output procedures to make this conversion so that you will observe 76 on your workstation rather than 01001100 ....
View Full Document

This note was uploaded on 06/20/2010 for the course CMPT 150 taught by Professor Dr.anthonydixon during the Spring '08 term at Simon Fraser.

Page1 / 2

SFU - CMPT 150 - Assignments - 4 - c A.H.Dixon CMPT 150 :...

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