The first assignment of the semester is to experiment with stacks and stack applications. You will write two applications, one which will consist of inputting a string representing a postfix expression, and evaluate the expression. The second will consist of inputting an infix expression, complete with parenthesis, and outputting the corresponding postfix expression (which you could subsequently run through your first application to find its value).
The abstract datatype 'stack' should be implemented in at least four different ways. Each of the above applications should be unaffected by the way 'stack' is implemented.
Program due date: January 30, 2012
Handin consists of a title page, external documentation, your source code (well documented) and sample execution. Code must also be demonstrated in class and submitted to my inbox.