Convert following infix expression to the prefix expression. a

Categories >> Software >> Operating Systems >> Data Structures
Suggest New Category

Convert following infix expression to the prefix expression.
a - b + c * (d / e - (f + g))

Question Posted / tokkadir

33 Answers
60408 Views
Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro, I also Faced
E-Mail Answers

Answers were Sorted based on User's Feedback

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / mrs saxena

+-ab*c-/de+fg

Is This Answer Correct ?

127 Yes

29 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / elle

a-b+c*(d/e-(f+g))
=a-b+c*(/de-(+fg))
=a-b+c*(T-S) where T=/de,S=+fg
=a-b+c*-(TS)
=-ab+c*-(TS)
=-ab+c*V where V=-TS
=-ab+*cV
=X+Y where X=-ab,*cV=Y
=+XY
=+-ab*cV
=+-ab*c-TS
=+-ab*c-/de+fg

Is This Answer Correct ?

41 Yes

7 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / bipin from utkal university mc

a-b+c*(d/e-(f+g))
a-b+c*(d/e-(+fg))
a-b+c*(/de-(+fg))
a-b+c*(-/de+fg)
a-b+(*c-/de+fg)
-ab+(*c-/de+fg)
+-ab*c-/de+fg (final answer)

Is This Answer Correct ?

34 Yes

5 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / tadveer verma

a-b+c*(d/e- (+fg))
a-b+c*(/de - +fg)
a-b+c* -/de+fg
a-b+ *c-/de+fg
-ab + *c-/de+fg
+-ab*c-/de+fg

Is This Answer Correct ?

13 Yes

2 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / lucky

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

Is This Answer Correct ?

14 Yes

4 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / nikhil kumar saraf

-a+b*c-/de+fg

Is This Answer Correct ?

29 Yes

20 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / nikhil nautiyal

+-ab*c-/de+fg

Is This Answer Correct ?

24 Yes

15 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / ankita roy

+-ab*c-/de+fg

Is This Answer Correct ?

10 Yes

3 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / madhu

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

Is This Answer Correct ?

11 Yes

4 No

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))..

Answer / bipin fro uu mca

a-b+c*(/de-(+fg))
a-b+c*(-/de+fg)
a-b+*c-/de+fg
-ab+*c-/de+fg
+-ab*c-/de+fg

Is This Answer Correct ?

8 Yes

2 No

Post New Answer

More Data Structures Interview Questions

How can I study data structures and algorithms?

0 Answers

What’s the difference between enumeration and iterator interfaces?

0 Answers

What is the data structures used to perform recursion?

1 Answers

What is weight balanced tree in data structure?

0 Answers

Write the procedure to convert general tree to binary tree?

0 Answers

What is binary tree and its types?

0 Answers

Why would you use a linked list?

0 Answers

What are the difference between a stack and a queue?

0 Answers

How can we reverse the order in the treemap?

0 Answers

How many links are there in a binary tree of N nodes?

0 Answers Tech Mahindra,

What is the space complexity of bubble sort?

0 Answers

What are the scenarios in which an element can be inserted into the circular queue?

0 Answers

For more Data Structures Interview Questions Click Here