State TRUE or FALSE for the following cases:
Stack is a linear data structure
True - Stack is a linear data structure where elements are arranged sequentially, and operations are performed at one end only.
Stack does not follow LIFO rule
False - Stack follows LIFO rule (Last In First Out), meaning the element inserted last is the first one to be removed.
PUSH operation may result into underflow condition
False - PUSH operation may result into overflow condition when the stack is full. Underflow condition occurs during POP operation when the stack is empty.
In POSTFIX notation for expression, operators are placed after operands
True - In POSTFIX notation, operators are placed after operands. For example, A + B in infix becomes A B + in postfix notation.
Explanation
This question tests fundamental concepts of Stack data structure from NCERT Class 12 Computer Science. Stack is indeed a linear data structure where elements are organized sequentially. The LIFO (Last In First Out) principle is the defining characteristic of stack operations. Students must distinguish between overflow (PUSH on full stack) and underflow (POP on empty stack) conditions. Postfix notation, also called Reverse Polish Notation, places operators after their operands, which eliminates the need for parentheses in expressions.