Interested to Buy Any Domain ? << Click Here >> for more details...
Which data structure is needed to convert infix notations to
post fix notations?
- 20 Answers
- 44460 Views
- Fidelity, Infosys, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / naresh
stack...since the operator last placed must be retrieved
first.
| Is This Answer Correct ? | 23 Yes | 5 No |
Answer / hodan
i need c++ Reverse Polish Notation (RPN) calculator that
evaluates postfix expressions. The calculator will
emphasize on the usage of a stack-like data
structure and stream I/O.
An Overview of RPN (postfix) evaluation
Consider the mathematical expression
(6 + 4) * 3 - 5
| Is This Answer Correct ? | 14 Yes | 6 No |
Answer / kavitha
stack is only one where it allows the conversion of
notations i.e prefix<-> postfix<-> infix<-> conversions
| Is This Answer Correct ? | 9 Yes | 2 No |
Answer / aditya
stack since conversion frm regular to postfix and similarly
frm regular to infix is based on stack concept so its a
stack aplication
| Is This Answer Correct ? | 10 Yes | 4 No |
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
What is difference between hashmap and hashset?
Why do we use arrays?
Define disjoint set adt?
How do you find the length of an arraylist?
What is the method to find the complexity of an algorithm?
Can we override compareto method for enumerations?
Define the tree data structure.
Describe the merge sort principle and what will be its time complexity?
No. of possible ordered trees with n nodes ? Please give formula (if any).
Which is better merge or quick sort?
Tell me do array subscripts always start with zero?
Windows 
