Question

STACK follows __________ principle, where insertion and deletion is from __________ end/ends only.

• A. LIFO, two
• B. FIFO, two
• C. FIFO, top
• D. LIFO, one

Hint:

Remember: Stack → LIFO (push and pop from top). Queue → FIFO (enqueue at rear, dequeue from front).

Answer 1

The Correct Option is D

Step 1: Grasp Stack Principle.
A stack is a linear data structure operating on the LIFO (Last In, First Out) principle. The last element added is the first one removed.
Step 2: Insertion and Deletion.
Both insertion (PUSH) and deletion (POP) are confined to a single end, known as the top of the stack.
Step 3: Evaluate Options.
- Option 1: LIFO, two → Incorrect; operations are restricted to one end.
- Option 2: FIFO, two → Incorrect; FIFO is characteristic of queues, not stacks.
- Option 3: FIFO, top → Incorrect; this mixes queue behavior with stack location.
- Option 4: LIFO, one → Correct; aligns with LIFO and single-end operations of a stack.

Final Answer: \[\boxed{\text{LIFO, one}}\]