[ Sivu suomeksi]

Computer Organization II,  Fall 2001, HW 3

Please note that the English speaking practice group (Tue 12-14) has been cancelled due to lack of students.

1. Problem 7.4 from the book. (s. 269)

    

2. Problem 7.7 from the book.

    

3. Problem 7.9 from the book.

    

4. Is it possible that Booth's algorithm (s. 291) would be clearly slower than normal multiplication algorithm (p. 289) for Twos complement integers? If it is, please give an example. If it is not, please give a detailed reasoning..
    
5. Problem 8.7 from the book. (p. 315)

    

6. Problems 8.20 and 8.24 from the book.