What is a stack data explain with example in data structure?

Answer 1

One way to emulate a stack with a data structure is with a singly linked list wherein you can only add and remove nodes from the head or tail of the list (depending on implementation). An easy and straightforward application of this type of data structure would be a reverse polish notation calculator where values can be pushed onto the data structure and then popped when one comes across an arithmetic symbol.

Answer 2

Stacks provide an automatic means of backtracking because variables are popped from the stack in the reverse order they were pushed onto the stack. Thus you can always find your way back to a given state. Every thread in a process has its own built-in stack, making it possible for functions to know from where they were called and thus return control to their callers. The callers simply push the return address onto the stack before passing control to the callee. The return address stays on the stack until the callee is ready to return control to the caller. Thus functions can call functions (including recursive calls to themselves) without losing track of where each individual call came from. The stack essentially provides a "breadcrumb trail". The stack is also used to store a function's local arguments since these only need to remain in memory when the function is actually invoked (they will fall from scope as soon as the function returns). Callers can also pass arguments to functions by pushing them onto the stack immediately after the return address. The stack can also be used to store a function's exception handlers, so when an exception occurs, the stack can automatically "unwind" back through the return addresses to locate a suitable handler.

Answer 3

stack is data structure used to store the continues block memory and operations insertion,deletion takes place at only at one end called TOP.

Answer 4

'Cos' it is one-dimensional.