Answer Posted / ashish

Algorithm for Infix to Prefix Conversion is
1. Reverse the given expression ...
2. Apply algorithm of infix to post-fix conversion...
3. Again reverse the expression after the post-fix conversion...


Infix Expression is => a - b + c * (d / e - (f + g))

step 1: => ( g + f ) - e / d ) * c + b- a

step 2: => apply post-fix ...

( ( g f + ) - e d / ) * c + b - a
( g f + e d / - ) * c + b - a
g f + e d / - c * + b - a
g f + e d / - c * b + - a
g f + e d / - c * b + a -

step 3: => final step reverse the expression ...

Prefix Expression = - a + b * c - / d e + f g

...
source :: http://scanftree.com/Data_Structure/infix-to-prefix

Which method will arrange the element of an array in alphabetical order?

1993

---

Can we give size to arraylist?

958

---

What are vectors used for in real life?

876

---

Is quicksort greedy algorithm?

1034

---

Tell me the difference between the character array and a string.

953

---

What is array indexing?

1016

---

What is the difference between list and arraylist?

932

---

What do you mean by data types?

947

---

What is the difference between hashset and treeset?

992

---

What is stack in geography?

859

---

Is null allowed in list?

854

---

Give us a program to reverse a linked list.

971

---

Write code for reversing a linked list.

955

---

What are the operations that can be performed on a stack?

913

---

write a program to accept name & sort them?

907

---