1. 8/23/2019 1

2. 8/23/2019
Figure 6.1 Relationship between the main program and a procedure.
Computer Architecture Parhami

3. Figure 6.2 Example of nested procedure calls.
Computer Architecture Parhami

4. Figure 6.3 Overview of the memory address space in MiniMIPS.
Computer Architecture Parhami

5. Figure 6.4 Effects of push and pop operations on a stack.
Computer Architecture Parhami

6. Figure 6.5 Use of the stack by a procedure.
Computer Architecture Parhami

7. Computer Architecture Parhami

8. Computer Architecture Parhami

9. Table 6.1 ASCII (American Standard Code for Information Interchange)1, 2
Computer Architecture Parhami

10. Figure 6.6 Load and store instructions for byte-size data elements.
Computer Architecture Parhami

11. Figure 6.7 A 32-bit word has no inherent meaning and can be interpreted in a number of equally valid ways in the absence of other cues (e.g., context) for the intended meaning.
Computer Architecture Parhami

12. Figure 6.8 Using the indexing method and the pointer updating method to step through the elements of an array.
Computer Architecture Parhami

13. Figure 6.9 One iteration of selection sort.
Computer Architecture Parhami

14. Figure 6.10 The multiply (mult) and divide (div) instructions of MiniMIPS.
Computer Architecture Parhami

15. Figure MiniMIPS instructions for copying the contents of Hi and Lo registers into general registers.
Computer Architecture Parhami

16. Figure 6.12 The four logical shift instructions of MiniMIPS.
Computer Architecture Parhami

17. Table 6.2 The 40 MiniMIPS instructions covered in Chapters 5–7.*
Computer Architecture Parhami

18. Computer Architecture Parhami