Answer Posted / narayan kunal

for evaluating the prefix expression first reverse the
prefix expression then sole like postfix expression
the reverse of given expression is
4231-+62++
then push 4,2,3,1 to stack ,now pop last two elements and
1-3=-2
now again push -2 to stack,now the element of stack is 4,2
,-2 again pop last two elements and do
-2+2=0
we know that if zero comes like symbol then we directly pop
this and proceed to next step
now the content of stack is 4 lets go to the next step
push 6 and 2 to the stack so now content of stack is 4,6,2
now
pop last two elements
6+2=8
push 8 to stack
content of stack is 4,8
again remove last two elements of elements and do
4+8=12
now all operator and operand ends up
so final answer is 12

What is a hash index?

931

---

What are the properties of binary tree?

954

---

How many types of sorting algorithms are there?

936

---

What is array and structure?

1036

---

What is the advantage of circular linked list?

867

---

What is data structure and why we need them?

936

---

What is the types of data structure?

1080

---

What do u mean by array?

963

---

Write a program to sum values of given array.

1081

---

why boundary tag representation is used?

966

---

What is ds tree?

958

---

What are the two traversal strategies used in traversing a graph?

1011

---

Devise a program to sort an array using bubble sort.

1138

---

Which data structure is applied when dealing with a recursive function?

1081

---

Explain binary searching and Fibinocci search?

1005

---