A stack is a fundamental __________ that operates in a Last-In, First-Out (LIFO / FILO) manner.
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 41 โ 50 of 222 Questions
Page 5 of 23
If the __________ instruction variant is not available, callee-side stack parameter cleanup becomes a complicated multi-step process.
True or False: When the stack eventually becomes full in 16-bit x86 architecture, the Stack Pointer (SP) will reach 0x0000, and subsequent PUSH operations will wrap around to 0xFFFE, producing stack overflow and unexpected memory corruption.
When the stack becomes full and pushing data past offset 0x0000 causes SP to wrap around and overwrite existing stack frame data, this situation is called stack __________.
The `POP` operation copies the 16-bit word from the current top of the stack into its specified __________.
Which x86 assembly instruction decrements SP (the Stack Pointer) by two and then transfers a word from the source operand to the top of the stack?
Executing `POP` transfers the word at the top of the stack (pointed to by SP) to the destination operand and then __________ SP by two to point to the new top of the stack.
To preserve register values across subroutine calls, the standard technique is to use __________ and __________ operations to save caller registers on the stack and restore them before returning.
When parameters are passed to a subroutine on the stack, the straightforward method to retrieve them inside the subroutine is to __________ them off the stack.
In standard stack frame creation, executing `push bp` performs which action?