Computer Organization II,  Autumn 2006, HW 4

1. Problem 8.6 [Stal06]          (8.4 [Stal03])   (7.4 [Stal99])


2. Problems 8.14 [Stal06]           (8.9 [Stal03])      (7.9 [Stal99])


3. Is it possible that Booth's algorithm (Fig. 9.12 [Stal06], Fig. 9.12 [Stal03], or Fig 8.12 [Stal99]) would be clearly slower than normal multiplication algorithm for Two's complement integers, given just before it in text book? If it is, please give an example. If it is not, please give a detailed reasoning.

 
4. Problem 9.13 [Stal06]             (9.7 [Stal03])      (8.7 [Stal99])


5. Problems 9.34 ja 9.36 [Stal06]         (9.20, 9.24 [Stal03])     (8.20, 8.24 [Stal99])
   How would the situation change, in part (b) of the latter problem the values were stored with five decimal numbers (instead of four)? What is the accuracy of variable C value?


6. Do one practice problem, using the method given in as given team project page. Use the question "Why do we not use the ttk-91 symbolic assembly language" in this course and possible answers
   1. It has too few registers.
   2. It does not have well enough specified hardware design.
   3. It does not have cache.
   4. It is an old-fashioned architecture.
   5. It is the architecture of the future.

   Come up with proper explanations for each answer. If you want, you can also come up with new possible answers. Select a proper callsification for the practice question and give true/false classification for each possible answer. This problem is suitable for team work with your project group.
   
   Please take an xml-printout of your problem to the class room.