applications of stacks and their uses?
- 1 Answers
- 4977 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 |
How do you sort an array in decreasing order?
What is subtree?
What are threaded binary trees?
What is binary tree and its properties?
What are the types of bulleted list?
List out the advantages of using a linked list?
What is data structure and its types?
State the difference between queues and linked lists?
How do treesets work internally?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
What is the difference between hashset and hashtable?
Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree (b) Complete Binary Tree.
Windows 
