Stack is a last in first out data structure.

Compare it with a box full of books -- you can take out only the uppermost book and can put a new book only at top.

Push() is an operation which puts an element onto the stack. Pop() is an operation which returns and deletes the topmost element on the stack.

OS uses stack for function calls -- if F1() calls F2() then on the stack F1() will be below F2(). So F1() can continue execution only when F2() completes and returns control back to F1().

stack is a linear data storage representation where data is stored and retrieved by using the concept of "last in first out". i.e whichever data is entered in the stack last that data is retrieved first.

Stack is the LIFO data structure. it has the two operation that is first one is push() operation and second one is the pop(). for example we take one container if container is full at the time stack is full. else container is empty at the time top is 0.

IN PROGRAMMING TERMS STACK CAN BE DEFINED AS A LINEAR DATA STRUCTURE WHICH POSSESSES
LIFO(LAST IN FIRST OUT) CHARACTERISTIC.HERE
THE ELMENT WHICH ENTERS THE STACK LEAVES IT
AT LAST BY THE PROCESS OF POPPING & ADDITION
OF ELEMENTS CAN TAKE PLACE BY PUSHING IT INTO THE STACK PROVIDED THE STACK IS NOT FULL.

A stack is an ordered collection of elements in which insertion and deletion are restricted to one end. The end from which element is added and/or removed is reffered to as top of the stack.The first element placed in the stack will be at the bottom of the stack.hence stack is reffered to as Last-in-First out(LIFO)lists.

If you have the better answer, then send it to us. We will display your answer after the approval.

Name :*
Email Id :*
Answer :*
Verification Code	Not readable? Load New Code
Enter the above shown code:*
	Inform me about updated answers to this question