{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

arch9702m - D D 1 Use Boot's Algorithm to compute-3 6 where...

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

View Full Document Right Arrow Icon
p ~ x * È «D ¹ «D ¹ª* È «D ¹ª 1. Use Boot’s Algorithm to compute -3 * 6, where both the multiplicand and multiplier are 4 bit number and the product is a 8 bit number (10%) 2. Use the nonrestoring binary integer division algorithm to perform 0000 1011 / 0011. (10%) 3. For a 4 bits carry look-ahead adder, define p i , the ith propagate term and g i the ith generate term. (4%). Let c 0 be the carry in the least significant bit. Write down c 4 in terms of c 0 , p i and g i (6%) 4. Show the IEEE 754 binary representation for the 20.5 10 in its hexadecimal form. (4%) 5. Add 2.85 × 10 3 to 9.84 × 10 4 , assuming that you have only three significant digits, first with guard and round digits and then without them. (6%) 6. Suppose you wish to run a program P with 5 × 10 9 instructions on a 4 GHz machine with a CPI of 1.2 (a). What is the expected CPU time?(5%)(b). A new implementation which can boost the clock rate but also increase the CPI from 1.2 to 1.5 is introduced. If we want P to be completed in 1.5 seconds, what is the clock rate ? (5%) 7.
Image of page 1

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

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}