This document describes algorithms for insertion and deletion operations on a stack data structure. It includes pseudocode for inserting an item at the top of the stack if it is not full, deleting the top item if the stack is not empty, and a procedure to check if the stack is empty by checking if the top pointer is less than 1. The document is submitted by Kanta Anuraga Sahoo and thanks the reader at the end.

1. SUBMITTED BY:
Kanta Anuraga Sahoo
220301120178

3. 1. Insertion(a,top,item,max)
2. If top=max then
print ‘STACK OVERFLOW’
else
3. Set top=top+1
4. Set stack[TOP]=item
5. end

4. 1. Deletion(a,top,item)
2. If top=0 then
print ‘STACK UNDERFLOW’
3. item=stack[top]
4. top=top-1
5. Exit

5. begin if top < 1 return true else return false end procedure
begin
if top < 1
return true
else
return false
end procedure

7. THANK YOU 