Subroutines
Lecture 13: Subroutines
222 Questions172 MCQs45 Short Questions5 Long Questions
Showing 61 – 70 of 222 Questions
Page 7 of 23
Q61❓ MCQ📑 Lec 5Easy🔁Repeated⭐High-Yield💡Conceptual
When the instruction `RET 2` completes execution, by how many bytes is the Stack Pointer (`SP`) incremented in total?
Q62❓ MCQ📑 Lec 5Easy🔁Repeated⭐High-Yield💡Conceptual
In 8088 / 8086 architecture, whenever an element is pushed onto the stack using `PUSH`, how is the Stack Pointer (`SP`) modified?
Q63❓ MCQ📑 Lec 5Easy🔁Repeated⭐High-Yield💡Conceptual
When a subroutine finishes execution, which instruction retrieves the saved return address from the stack and transfers program control back to that location?
Q64❓ MCQ📑 Lec 5Easy🔁Repeated⭐High-Yield💡Conceptual
Which x86 control flow instruction pushes the return address onto the stack and transfers execution to a subroutine, enabling code modularity and reusability?
Q65❓ MCQ📑 Lec 5Easy🔁Repeated⭐High-Yield💡Conceptual
The `CALL` instruction takes a subroutine name or label as its __________, and program execution branches to that label.
Q66❓ MCQ📑 Lec 5Easy🔁Repeated⭐High-Yield💡Conceptual
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`.
Q67❓ MCQ📑 Lec 5Easy🔁Repeated⭐High-Yield💡Conceptual
Which pair of instructions is commonly used together for subroutine control flow, although technically each operates independently?
Q68❓ MCQ📑 Lec 5Easy🔁Repeated⭐High-Yield💡Conceptual
The `CALL` mechanism breaks the linear thread of execution and preserves general registers, modifying only the __________ (and Stack Pointer SP).
Q69❓ MCQ📑 Lec 5Easy🔁Repeated⭐High-Yield💡Conceptual
In computer science, a stack is a linear __________ that operates in a First-In, Last-Out (FILO) or Last-In, First-Out (LIFO) manner.
Q70❓ MCQ📑 Lec 5Easy🔁Repeated⭐High-Yield💡Conceptual
If the __________ instruction is not available, clearing stack arguments by the callee subroutine becomes a complicated and inefficient process.