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.

Explain the uses of binary tree.

900

---

List the applications of set adt?

900

---

What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks

2528

---

What is the purpose of sorting algorithms?

956

---

Does map extend iterable?

923

---

What is the best case complexity of bubble sort?

836

---

Define hash table?

960

---

List some applications of queue data structure.

912

---

What is the use of hashtable?

867

---

Tell me about circular linked list?

921

---

State the demerits of linked representation of binary trees?

918

---

What is space complexity of a program?

863

---

Define probing?

1139

---

What is stack algorithm?

845

---

What is difference between hashmap and arraylist?

953

---