Introduction to the Stack ADT.
The student will:
Explain standard interface for a Stack.
Implement two different versions of the Stack interface.
Compare the trade-offs between the two different implementations.
The student will:
Explain the differences between prefix, infix and postfix notation.
Implement code to process prefix, infix and postfix equations.
Compare the trade-offs between the notations.
Quiz 10 Oct 12:00 AM
Outcomes assessed: Learn about and implement the Stack data structure
This assessment will verify that students understand the basics of Stacks by implementing a linked node based stack.
Assignment
Outcomes assessed: Learn about and implement the Stack data structure, Learn about and convert between prefix, infix, and postfix notation, Learn about the Java programming language, Use standard libraries or packages as well as advanced object-oriented programming techniques, Be exposed to software engineering techniques, Be exposed to software testing techniques
This assessment will verify that students understand the basics of Stacks by implementing a Postfix notation calculator.