A7 - STACK

A ______ is an Abstract Data Type (ADT), commonly used in most programming languages. It is named stack as it behaves like a real-world stack, for example – a deck of cards or a pile of plates, etc.

A ________ allows operations at one end only. For example, we can place or remove a card or plate from the top of the stack only. Likewise, Stack ADT allows all data operations at one end only. At any given time, we can only access the top element of a stack.

This feature makes it ____ data structure. ____ stands for Last-In-First-Out. Here, the element which is placed (inserted or added) last, is accessed first. In stack terminology, insertion operation is called PUSH operation and removal operation is called POP operation.

LIFO stands for _______.

A stack can be implemented by means of _____, _____, _____, and _______.

Stack can either be a fixed size one or it may have a sense of ___________.

Here, we are going to implement stack using ______, which makes it a fixed size stack implementation.

Stack operations may involve ______ the stack, ________ it, and __________ it. 

Pushing (storing) an element on the stack.

Removing (accessing) an element from the stack.