update,
This commit is contained in:
30
marissa.sam/task2/notes.md
Normal file
30
marissa.sam/task2/notes.md
Normal file
@@ -0,0 +1,30 @@
|
||||
我跟住佢 part1 part2 個方向去做個 source code, 但係 report 嗰部分我就唔需要做, 我諗你係咁嘅意思係咪?
|
||||
|
||||
# NOTES
|
||||
|
||||
The project requires you to write a simple calculator to evaluate arithmetic expressions. It
|
||||
includes two parts:
|
||||
|
||||
- In the first part, you need to convert the input to a postfix expression.
|
||||
- In the second part, you need to evaluate the postfix expression that you get in the first
|
||||
part.
|
||||
- You need to implement your algorithms using c++. Submit your code to Moodle.
|
||||
- You also need to write a report explaining the following items.
|
||||
|
||||
## Part 1: Convert an expression to postfix expression using stack in STL
|
||||
|
||||
1. how to read and store the input?
|
||||
2. pseudo code of the algorithm
|
||||
3. data structures used in the algorithm
|
||||
4. time complexity
|
||||
5. space complexity
|
||||
6. how to store the postfix expression?
|
||||
|
||||
## Part 2: Use stack of STL to evaluate a postfix expression
|
||||
|
||||
1. how to read the postfix expression
|
||||
2. pseudo code of the algorithm
|
||||
3. data structures used in the algorithm
|
||||
4. time complexity
|
||||
5. space complexity
|
||||
6. how to output the final result?
|
Reference in New Issue
Block a user