Evaluate the following prefix expression " ++ 26 + - 1324"
- 24 Answers
- 47692 Views
- College School Exams Tests, Patni, I also Faced
- E-Mail Answers
Answer Posted / navneet kang
++26 + -1324
METHOD:-
Start scanning the string from the right one character at a time.
If it is an operand, push it in stack.
If it is an operator, pop opnd1, opnd2 and perform the operation, specified by the operator. Push the result in the stack.
Repeat these steps until arr of input prefix strings ends.
Solution
1)Push 4,2,13 in stack one by one
2) - operator encountered
3)Take out 13 and 2 from stack and perform operation
4)Now Stack consist of 4,11
5)+ operator encountered
6)Now Stack consist of 15
7)Now push 6 in stack,Hence Now Stack consist of 15,6,2
8)Perform add operation + encountered
9)Now Stack consist of 15,8
10)+ operator encountered
11)Now Stack consist of 23
Hence Answer is 23
| Is This Answer Correct ? | 7 Yes | 3 No |
Post New Answer View All Answers
Tell me what should be done in the base case for this recursive problem?
To describe the Complexity of Binary search, Quicksort and various other sorting and searching techniques..
What is the complexity of sorting algorithm?
What is heap with example?
Differentiate between arraylist and vector.
What is stable sort?
What is a undirected graph?
Is list an array?
Define adjacent nodes?
Can we change load factor of hashmap?
What does the term sorting refer to?
How to show internal storage representation of data structure in RDBM?
Which is faster list or set?
Can we declare array size as a negative number?
What do you know about the big-o notation and can you give some examples with respect to different data structures?
