hw4 - and remainder obtained in dividing 59 by 17. Use the...

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

View Full Document Right Arrow Icon
C-355 Homework # 4 (Due 07/24) Q1. Use the unsigned multiplication algorithm to compute 23 X 29 with the minimum number of bits. Q2. Given x = 0101 and y = 1010 in two’s complement notation , compute the product p = x X y with Booth’s algorithm Q3. Use the n/n bits division algorithm (Flowchart in Fig 9.16) to find the quotient
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: and remainder obtained in dividing 59 by 17. Use the minimum number of bits required Q4. Perform the following signed division using the algorithm given in the text. Use minimum number of bits 5 14-Verify the results obtained...
View Full Document

This note was uploaded on 01/17/2012 for the course ECEC 355 taught by Professor Billmongan during the Spring '11 term at Drexel.

Ask a homework question - tutors are online