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

Explain Queue

1059

---

Which algorithm is used in arrays sort?

905

---

List some applications of tree-data structure?

889

---

Is python good for freshers?

981

---

What is the difference between binary tree and binary search tree?

884

---

What do you mean by data types?

950

---

What is the minimization factor and time complexity of b-tree?

1151

---

State the properties of b tree.

1041

---

Define secondary clustering?

920

---

Is selection sort greedy?

884

---

Is array faster than arraylist?

954

---

What is a matrix? Explain its uses with an example

1155

---

what is the difference between dynamic as well as non - dynamic data structures.

957

---

What is the capacity of arraylist?

938

---

Explain linear linked implementation of Stack and Queue?

1062

---