Answer Posted / navneet kang

++26 + -1324
METHOD:-
Start scanning the string from the right one character at a time.
If it is an operand, push it in stack.
If it is an operator, pop opnd1, opnd2 and perform the operation, specified by the operator. Push the result in the stack.
Repeat these steps until arr of input prefix strings ends.
Solution
1)Push 4,2,13 in stack one by one
2) - operator encountered
3)Take out 13 and 2 from stack and perform operation
4)Now Stack consist of 4,11
5)+ operator encountered
6)Now Stack consist of 15
7)Now push 6 in stack,Hence Now Stack consist of 15,6,2
8)Perform add operation + encountered
9)Now Stack consist of 15,8
10)+ operator encountered
11)Now Stack consist of 23

Hence Answer is 23

How do we find duplicate elements in an array?

974

---

Write the importance of hashing?

1032

---

How do you find the index of an element in an arraylist?

881

---

What is return map?

966

---

State the different ways of representing expressions?

1212

---

What is complexity algorithm?

889

---

What is a vector element?

900

---

What are the basic data structures?

995

---

Tell me do array subscripts always start with zero?

888

---

What is minimum depth of binary tree?

973

---

Write an algorithm to show the reverse of link list?

866

---

What is lifo?

1427

---

What do you mean by probing?

975

---

What are the different types of sorting? Explain the difference between them.

1039

---

How to reference all the elements in a one-dimension array?

1286

---