{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CGS3269_HW1_Spring07

# CGS3269_HW1_Spring07 - two’s complement representation(15...

This preview shows page 1. Sign up to view the full content.

UCF School of EECS CGS 3269 Computer Architecture Spring 2007 DUE 2/13/07 1. Using 4 bit numbers(for example (5) 10 = ( 0101) 2 Write all positive numbers and all negative numbers that can be represented with four bits in sign-magnitude, one’s complement, and two’s complement. (20 points) 2. Using binary numbers of 8 bits(i.e. (28) 10 = ( 0001 1100) 2 ). Write the numbers from (1) 10 to (20) 10 in binary, octal, and hexadecimal. (15 points) 3. Convert: (10 points) a) from (18) 10 to (?) 2 b) from (10011100011) 2 to (?) 16 c) from (10011100011) 2 to (?) 8 d) from (10011100011) 2 to (?) 10 4. Convert to binary and solve the following arithmetic operations using one’s complement representation : (15 points) a) (18) 10 + (13) 10 b) (18) 10 - (13) 10 c) -(18) 10 - (13) 10 5. Convert to binary and solve the following arithmetic operations using
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: two’s complement representation : (15 points) a) (18) 10 + (13) 10 b) (18) 10- (13) 10 c)-(18) 10- (13) 10 6. Using the tiny computer assembly language explained in class, write a program that computes the following expression: z a * b * c. The computer will read in the input values (a, b, c, and read in the value zero for z) from the keyboard, and all the input values and the final result (z) have to be printed out on the printer. In addition, every time an input value is read in, it must be displayed on the screen. Remember that the instruction set does not have an instruction to execute multiplication. (25 points)...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online