What data structure is utilized internally by the runtime call stack to manage nested subroutine execution and local variable scope?
Answer and explanation
Correct answer: C. Stack
- Step 1: Consider the order in which functions are called and returned: the most recently invoked function must finish and return before the caller can resume.
- Step 2: This Last-In, First-Out (LIFO) execution order is implemented using a call Stack (pushing stack frames on call, popping on return).
Answer
Stack.
Why not the others: Queues enforce FIFO ordering; linked lists are generic sequential nodes; priority queues order items by numerical priority.
Practise more Algorithms and Python Programming.
Free questions with an explanation for every one, and full timed EmSAT Achieve (UAE) mock tests.
More Algorithms and Python Programming questions
- What is the output of the following Python expression: [x**2 for x in range(6) if x % 2 != 0]?
- What is the worst-case time complexity of searching for an element in a balanced binary search tree (AVL tree) containing n nodes?
- What will be printed by the following Python code snippet?
def func(val, lst=[]):
lst.append(val)
return lst
print(func(1))
print(… - Which abstract data structure operates on a First-In, First-Out (FIFO) ordering principle?
- What is the return value of executing the recursive Python function `mystery(4)`?
def mystery(n):
if n <= 1:
return 1
retur… - What is the worst-case time complexity of the standard QuickSort algorithm when the chosen pivot is consistently the smallest or largest ele…