The stack is where all the functions? local (auto) variables are created. The stack also contains some<br>information used to call and return from functions.<br><br>A ?stack trace? is a list of which functions have been called, based on this information. When you start using a debugger, one of the first things you should learn is how to get a stack trace.<br><br>The stack is very inflexible about allocating memory; everything must be deallocated in exactly the reverse order it was allocated in. For implementing function calls, that is all that?s needed. Allocating memory off the stack is extremely efficient. One of the reasons C compilers generate such good code is their heavy use of a simple stack.<br><br>There used to be a C function that any programmer could use for allocating memory off the stack. The<br>memory was automatically deallocated when the calling function returned. This was a dangerous function to call; it?s not available anymore.

A stack is a linear data structure where insertion and deletion of an item can takes place at one end called "TOP" of the stack.And it is a LIFO(Last-in First-out) mechanism.

stack is a part of memory.it is the storage area of automatic variables. stack is a linear data structure where insertion and deletion takes place at only one end of it "top" and it works according to LIFO principle

Stack is a linear data structure in which insertion and deletion are made at one end called TOP and it always initializes to -1.stack is LIFO list and it has PUSH and POP operations for insertion and deletion.insertion and deletion are made dynamically.

stack is a linear data structure in which insertions and deletions can take only at one end.Push and pop are two operations associated with stack.Push means to insert and pop means to remove an element from the top of stack.It is a LIFO list.Stacks are used to store variables and instructions during execution of the program.

Stack is a linear, non-primitive data structure.The PUSH(insrtion) and POP(deletion)operations are performed at only one end that is pointed by a variable called TOP.It is a data structure based on the LIFO(last-in,first-out) Mechanism.

Stack is a linear data-structure which operates as LIFO(last-in-first-out)manner.which contains PUSH(),POP() as standard subroutines and SEEK() as non-standard subroutine.And also it contain all the recursive calls information in the LIFO order.

a stack is a linear data structure in which insertion and deletion only at one end called the top of the stack. this means, in particular that elements are removed from a stack in the reverse order in which they particular by means. it is performed on LIFO function. stack is performed on two operations: 1.PUSH:- PUSH is the used to insert an item into stack. 2.POP:-POP is the term used to delete an item from stack.

stack is ordered data structure. Stack operations are based on LIFO(LAST IN FIRST OUT)concepts. There are mainly two operations. they are, 1.PUSH-insert element into stack 2.POP0- remove elements form stack insertion and deletion take at one end is known as TOP.

Stack is a type of linear data structure . It is a ordered collection of homogeneous element where the insertion and deletion take place at one end only. By definition top of the data element is designated as TOP of the stack. In the case of stack, insertion and deletion can be specially termed as PUSH and POP repectively.

Stack is an ordered list where insertion and deletion is performed at the same end. ie.. at TOP of the stack and mechanism applied is Last in First out