- World's Largest Collection of Interview Questions
Interview Success Kit - 9,000 Interview Que. & Ans.
Covers 9,000+ Interview Questions asked in actual MNC Interviews - all with model answers.
Start Your Own website Now
Sponsored Links

Interview Questions
Our Services

Question :
What is the stack?
Category Data Structure Interview Questions
Rating (0.3) By 19 users
Added on 10/22/2004
Views 7188
Rate it!

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.

Posted by: Ajay.s.m    

Contact Ajay.s.m Contact Ajay.s.m

stack is data structure ....<br>where it works on the principle of lifo ie(last in first out)<br>eg: stack of books

Posted by: sushanth    

Contact sushanth Contact sushanth

stack is a part of 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

Posted by: RWEHIRU    


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.

Posted by: uday kumar    

Contact uday kumar Contact uday kumar

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.

Posted by: surabhi shrivastava    

Contact surabhi shrivastava Contact surabhi shrivastava

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.

Posted by: Anjali Bhatt    

Contact Anjali Bhatt Contact Anjali Bhatt

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.

Posted by: kumaraswamy dapa    

Contact kumaraswamy dapa Contact kumaraswamy dapa

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.

Posted by: prabhat chaudhary    

Contact prabhat chaudhary Contact prabhat chaudhary

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.

Posted by: thinagar    

Contact thinagar Contact thinagar

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

  • There should not be any Spelling Mistakes.
  • There should not be any Gramatical Errors.
  • Answers must not contain any bad words.
  • Answers should not be the repeat of same answer, already approved.
  • Answer should be complete in itself.
  • Name :*
    Email Id :*
    Answer :*
    Verification Code Code Image - Please contact webmaster if you have problems seeing this image code Not readable? Load New Code
    Process Verification  Enter the above shown code:*
    Inform me about updated answers to this question

    Related Questions
    View Answer

    Please Note: We keep on updating better answers to this site. In case you are looking for Jobs, Pls Click Here - Best Freshers & Experienced Jobs Website.

    View ALL Data Structure Interview Questions

    User Options
    Sponsored Links

    Copyright ©2003-2016, All Rights Reserved.
    Privacy Policy | Terms and Conditions

    Download Yahoo Messenger | Placement Papers| FREE SMS | ASP .Net Tutorial | Web Hosting | Dedicated Servers | C Interview Questions & Answers

    Testing Articles | Testing Books | Testing Certifications | Testing FAQs | Testing Downloads | Testing Interview Questions | Testing Jobs | Testing Training Institutes

    Cache = 0 Seconds