SFU - CMPT 150 - Solutions - Assignments - 1

# SFU - CMPT 150 - Solutions - Assignments - 1 - c A.H.Dixon...

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

c ± A.H.Dixon CMPT 150 : ASSIGNMENT 1 1 Due 23:59 Monday, January 28, 2008 (2 pages) NOTE: Before you prepare your ﬁnal submission, please access the course website and check the ”Submissions” link of the course website 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. 1. These days, a typical computer word is either 32 or 64 bits long. For each of the following encodings, determine the number of unsigned integers that can be represented with 32 bits and with 64 bits: (a) Fixed length binary encoding (base 2). 32 bits = 2 32 64 bits = 2 64 (b) BCD encoding. 32 bits = 8 BCD digits = 10 8 numbers 64 bits = 16 BCD digits = 10 16 numbers (c) 8-bit ASCII encoding. This encoding is very similar to 7-bit ASCII as given on page 27 of the textbook, except that 8-bit codewords are used rather than 7. You may assume the leftmost bit is 0. 32 bits = 4 ASCII characters = 10 4 numbers 64 bits = 8 ASCII characters = 10 8 numbers NOTE: You may leave your answers expressed as powers of 2 or 10 (as

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.

## 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 / 5

SFU - CMPT 150 - Solutions - Assignments - 1 - c A.H.Dixon...

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

View Full Document
Ask a homework question - tutors are online