applications of stacks and their uses?
- 1 Answers
- 4951 Views
- Mind Tree, Samsung, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Describe full binary tree and complete binary tree.
What is a sorting algorithm in data structure?
Which is faster hashmap or hashtable?
Is set sorted?
How hashmap increases its size?
What type of memory allocation is referred for Linked lists?
What is mean by sorting?
What is entryset method in map?
What is the difference between Strings and Arrays?
Which method will arrange the element of an array in alphabetical order?
Describe tree database. Explain its common uses.
How do you access the values within an array?
What is different between array and list?
Explain the difference between hashset and hashmap?
How does insertion sort works?
