Stack Register

• stack bottom The largest valid address of a stack. When a stack is initialized, the stack pointer points to the stack bottom.
• stack limit The smallest valid address of a stack. If the stack pointer gets smaller than this, then there's a stack overflow (this should not be confused with overflow from math operations).

A stack pointer is a small register that stores the address of the last program request in a stack.
A stack is a specialized buffer which stores data from top down to bottom.
As new requests come in, they "push down" the older ones. The most recently entered request always resides at the top of the stack, and the program always takes requests from the top.
A stack (also called a pushdown stack) operates in a last-in/first-out sense. When a new data item is entered or "pushed" onto the top of a stack, the stack pointer increments to the next physical memory address, and the new item is copied to that address. When a data item is "pulled" or "popped" from the top of a stack, the item is copied from the address of the stack pointer, and the stack pointer decrements to the next available item at the top of the stack.
Check out for the next post on bode plots and Nyquist plots
aidgambinya@gmail.com