In a stack implementation using an array of size N, pushing an element when 'top == N - 1' causes:
When top reaches the maximum allocated array capacity (N - 1), attempting to push another item results in Stack Overflow. For an array indexed from 0 to N-1, top == N-1 means all N positions are occupied. The push must be rejected or capacity must be increased in a resizable implementation.
In a stack, popping an element when 'top == -1' triggers which condition?
Attempting to remove or pop an item from an empty stack (where top == -1) triggers a Stack Underflow error. With the common array-stack convention top == -1 represents an empty stack. A pop is invalid in this state; check emptiness before accessing the array.
Conversion of an Infix expression 'A + B * C' to Postfix notation yields:
Operator precedence dictates '*' is evaluated before '+'. Thus 'B * C' becomes 'BC*', and adding 'A' gives 'A BC* +'. Multiplication has higher precedence than addition, so B*C is emitted before the addition. The equivalent postfix expression is A B C * +; postfix evaluation then needs no parentheses.
Which data structure follows the First-In-First-Out (FIFO) principle?
A Queue follows the FIFO principle where elements are inserted at the rear and removed from the front. Enqueue inserts at the rear and dequeue removes from the front. A basic queue supports both operations in O(1) with suitable front/rear pointers or a circular array.
Which data structure is fundamentally utilized by recursion for managing function call frames?
Operating systems maintain a System Call Stack (Call Stack) to push return addresses and local variables whenever a recursive function call occurs. Each call pushes an activation record containing information such as parameters, local variables and the return address. When a call returns, its frame is popped; deep recursion can therefore cause stack overflow.