applications of stacks and their uses?
- 1 Answers
- 4955 Views
- Mind Tree, Samsung, I also Faced
- E-Mail Answers
Answer / shreyank
Keeping track of nested invocation calls in a procedural
programming language, such as C/C++.
Each function call results in a new entry being placed into
the program run-time stack. This new
entry contains memory space for local variables (which can
grow dynamically) and for a return
pointer to the instruction in the function that invoked the
current function (caller/callee). As
functions terminate, their stack entry is "popped out," with
the return values written to the proper
location in the caller.
Since nested procedural/ function invocation levels are
entered and exited in LIFO order, a stack
is the most appropriate data structure to handle this
functionality.
Evaluating arithmetic expressions.
Stacks can be used to parse arithmetic expressions and
evaluate them efficiently, as we shall
see as part of this assignment.
To eliminate the need for direct implementation of recursion.
As recursive function calls require a lot of overhead, it is
often the case that recursive algorithms
are "unrolled" into non-recursive ones. Since recursive
calls are entered/exited in LIFO order the
use of stacks to mimic recursion is a natural choice.
| Is This Answer Correct ? | 6 Yes | 0 No |
Where is insertion sort used?
Which sort show the best average behavior?
What is complete binary tree in data structure?
What are the parts of root node?
How to find middle element of linked list in one pass?
What is array and its types in data structure?
What are linear and non linear data structures?
What is the default capacity of hashmap?
How to get a list of tables, views and columns in firebird database?
List out the basic operations that can be performed on a stack?
What is the minimum number of queues needed when implementing a priority queue?
Does arraylist maintain order?
Windows 
