A (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.

(a)  

LIFO stands for (a)   .

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

(a)  

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

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

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

(a)  

Pushing (storing) an element on the stack.

(a)  

Removing (accessing) an element from the stack.

(a)  

When data is (a)   ed onto stack.

To use a stack efficiently, we need to check the status of stack as well.

get the top data element of the stack, without removing it.

(a)  

check if stack is full.

(a)  

check if stack is empty.

(a)  

At all times, we maintain a pointer to the last PUSHed data on the stack. As this pointer always represents the ___ of the stack, hence named ___. The ___ pointer :provides ___ value of the stack without actually removing it.

(a)  

The process of putting a new data element onto stack is known as a ____ ______. 

(a)  

In the push operation. This step checks if the stack is full.

(a)  

In the push operation. This steps seeks if the stack is full, produces an error and exit.

(a)  

In the push operation. This step seeks if the stack is not full, increments top to point next empty space.

(a)  

In the push operation. This step adds data element to the stack location, where top is pointing.

(a)  

In the push operation. This step shows a returns success.

(a)  

Accessing the content while removing it from the stack, is known as a _______ . In an array implementation of _______, the data element is not actually removed, instead top is decremented to a lower position in the stack to point to the next value. But in linked-list implementation, pop() actually removes data element and deallocates memory space.

(a)  

In the pop operation. This step checks if the stack is empty.

(a)  

In the pop operation. This step seeks if the stack is empty, produces an error and exit.

(a)  

In the pop operation. This step seeks if the stack is not empty, accesses the data element at which top is pointing.

(a)  

In the pop operation. This step decreases the value of top by 1.

(a)  

In the pop operation. This step shows a returns success.

(a)