What does a Stack data structure implement?

What does a Stack data structure implement?

• A. First In Last Out data storage.
• B. First In First Out data storage.
• C. Random access data storage.
• D. Circular storage.

Answer: (A)

A stack uses a Last In, First Out behavior. The option described as “First In Last Out” means the first item that goes in will be the last one to come out, so the most recently added item comes out first. That matches how a stack operates: push adds to the top, pop removes from the top, so the newest entry is removed before older ones. For example, push A, then B, then C; popping yields C, then B, then A. This is different from a queue (First In First Out), and it’s not about random access or a circular storage structure.

A stack uses a Last In, First Out behavior. The option described as “First In Last Out” means the first item that goes in will be the last one to come out, so the most recently added item comes out first. That matches how a stack operates: push adds to the top, pop removes from the top, so the newest entry is removed before older ones. For example, push A, then B, then C; popping yields C, then B, then A. This is different from a queue (First In First Out), and it’s not about random access or a circular storage structure.