When the instruction `RET 2` completes execution, by how many bytes is the Stack Pointer (`SP`) incremented in total?
Ch 05: Subroutines and Stack Architecture
Examines stack memory allocation, downward growth of the stack, return address pushing, caller vs callee register preservation, and avoiding stack misalignment bugs.
222 Questions222 MCQs0 Short Questions0 Long Questions
SEMESTER PASS
CS401 - Computer Architecture and Assembly Language Programming Examination Practice
Timed practice exam simulation for CS401 - Computer Architecture and Assembly Language Programming.
Showing 61 – 70 of 222 Questions
Page 7 of 23
In 8088 / 8086 architecture, whenever an element is pushed onto the stack using `PUSH`, how is the Stack Pointer (`SP`) modified?
When a subroutine finishes execution, which instruction retrieves the saved return address from the stack and transfers program control back to that location?
Which x86 control flow instruction pushes the return address onto the stack and transfers execution to a subroutine, enabling code modularity and reusability?
The `CALL` instruction takes a subroutine name or label as its __________, and program execution branches to that label.
When the __________ instruction is encountered inside a subroutine, it pops the saved return address from the stack and transfers execution back to the instruction immediately following the `CALL`.
Which pair of instructions is commonly used together for subroutine control flow, although technically each operates independently?
The `CALL` mechanism breaks the linear thread of execution and preserves general registers, modifying only the __________ (and Stack Pointer SP).
In computer science, a stack is a linear __________ that operates in a First-In, Last-Out (FILO) or Last-In, First-Out (LIFO) manner.
If the __________ instruction is not available, clearing stack arguments by the callee subroutine becomes a complicated and inefficient process.