Using the standard two-stack method, how many stacks are used to implement a FIFO Queue?
The standard implementation uses two stacks: one stack for enqueue operations and another for dequeue operations, transferring elements between them when needed.
What is tail recursion in computer programming?
Tail recursion occurs when the recursive call is the last instruction executed, allowing compilers to optimize stack frame usage (tail call optimization).
What is the minimum number of moves required to solve the Tower of Hanoi problem with N disks?
The recurrence for Tower of Hanoi is T(N) = 2T(N-1) + 1, which solves to $2^N - 1$ total disk moves.
Which of the following are common applications of a Stack data structure?
Stacks are used for undo/redo histories, runtime call stacks, and parsing or checking nested structures such as parentheses. Therefore more than one option is correct.
Convert the infix expression '(A + B) * C' to prefix notation.
Parentheses enforce (A + B) evaluation first -> + A B. Then multiplying by C yields '* + A B C'.