Chapter 8: Data Structures

Content locked

The catalog is public. Reading this content requires approved access.

8.1 Subroutines

8.1.1 The Call/Return Mechanism

8.1.2 JSR(R)—The Instruction That Calls the Subroutine

8.1.3 Saving and Restoring Registers

8.1.4 Library Routines

8.2 The Stack

8.2.1 The Stack—An Abstract Data Type

8.2.2 Two Example Implementations

8.2.3 Implementation in Memory

8.2.4 The Complete Picture

8.3 Recursion, a Powerful Technique When Used Appropriately

8.3.1 Bad Example Number 1: Factorial

8.3.2 Fibonacci, an Even Worse Example

8.3.3 The Maze, a Good Example

8.4 The Queue

8.4.1 The Basic Operations: Remove from Front, Insert at Rear

8.4.2 Wrap-Around

8.4.3 How Many Elements Can We Store in a Queue?

8.4.4 Tests for Underflow, Overflow

8.4.5 The Complete Story

8.5 Character Strings

Exercises

Source