Computer Organization II,  Autumn 2006, HW 5

1. Problems 10.6 and 11.18 [Stal06]          (10.3 and 11.12 [Stal03])   (9.3 and 10.11 [Stal99])
   You may assume that each instruction ses has a DIV instruction.
   Three address instruction sets have of course three operands
   (missprint in the very old text book [Stal99], see http://www.cs.helsinki.fi/u/kerola/tikra/coa_errata/errata.txt).
   Also assume, that variables A, B, C, D, E, F and X are in memory.

2. Problem 11.7 [Stal06]                                 (11.6 [Stal03]) (10.5 [Stal99])
   Give example instruction for parts (a) and (b).
   Would is be worthwhile in the instruction to place the opcode only after the operands? Why?

3. Problem 10.17 [Stal06]                                 (10.9 [Stal03]) (9.7 [Stal99])
   

4. Problem 12.11 [Stal06]                                 (12.3 [Stal03]) (11.3 [Stal99])
    
5. Problem 12.13 [Stal06]                                 (12.5 [Stal03]) (11.5 [Stal99])
   Also,
   1. Give an example on situation, where the algorithm in Figure 12.17 [Stal06] (12.17 [Stal03]) (11.16 [Stal99]) would be better than the two other alternatives.
   2. Give an example on situation, where the left side algorithm in Figure 12.25 [Stal06] (12.25 [Stal03]) (11.24 [Stal99]) would be better than the two other alternatives.
   3. Give an example on situation, where the right side algorithm in Figure 12.25, [Stal06] (12.25 [Stal03]) (11.24 [Stal99]) would be better than the two other alternatives.

   Please notice that the left side state diagram in Figure 11.24 [Stal99] in the very old text book has a typo: lower leftmost state should be "Predict Taken".
   
   

6. Problems 13.6 and 13.9 [Stal06]                        (13.5 and 13.7 [Stal03])    (12.5 and 12.7 [Stal99])
   (covered in lectures in week 40)