possible D3: Lists-Stacks As you may notice, the stacks are one of the powerful
ID: 3704088 • Letter: P
Question
possible D3: Lists-Stacks As you may notice, the stacks are one of the powerful ADT in programming and program solving in computer science. For this discussion,first, please read Chapter 3.6.3 from your textbook carefully 1) In this discussion, I want you to discuss the major applications and benefits of stacks in programming and computer science. When you are discussing the topic, please give solid explanation. For example, if you explain how stacks are being used for function calls particularly for recursion, please provide a little more information about it so that everyone can benefit from it. 2)Another issue that I want you to think about is the relation between the stacks and infix, prefix, postfix notations. What is the main advantage of using postfix notation over infix notation? loread SuberrihaExplanation / Answer
Solution:
1)
The stack follows Last in First out approach.
2)
We use postfix notation because of the reason that it is easy to evaluate it by using stack where the order of operators and operands is maintained and based on certain rules the expression is evaluated.
I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.