| Homework 8DetailsDo the following exercises from pages 109-113 of your textbook (103-107 in full book).
Problem | Points | Comments
|
---|
14 | 6
| 18 | 4 | Make sure you explain your answer.
| 19 | 4 | Give a clear justification based on your solution to 18.
| 21 | 4
| 23b | 4
| 28 | 2 | First write out what each instruction does. Then read your "pseudo-code" version to figure it out.
| 34aei | 6
| 39bc | 4
| 25 | 2 | See note below
| Problem 1 below | 4 | See note below
|
-
Write a program in the machine language described in the Appendix of our textbook that places FF in all memory cells from address A0 through C0.
Your program should be in memory cells 00 through 13 (and no more).
Note: All numbers in this problem given in Hexadecimal.
Note:
You can choose to do either 25 or problem 1, but not both. Notice that 25 is only worth 2 points, so if you attempt that one your maximum homework score will be 36/38. If you do #25, you can include it with your written assignment.
If you do Problem 1, write and test your program in BMach. Use version 1.4 (the older versions have a bug).
Put enough comments in your code to indicate that you understand what your code is doing. Save your program in BMach and call it Problem1.txt. E-mail me your textfile.
|