Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
aa:lab:13 [2021/01/22 09:00] pdmatei |
aa:lab:13 [2021/01/25 20:10] (current) stefan.stancu [ADT implementation] |
||
|---|---|---|---|
| Line 35: | Line 35: | ||
| ==== ADT implementation ==== | ==== ADT implementation ==== | ||
| - | Implement the ''ADT'' ''Tree'' and ''FIFO'' in Python, together with its operations. **Use two stacks to implement the ''FIFO''**. | + | Implement the ''ADT'' ''Tree'' and ''FIFO'' in Python, together with thier operations. **Use two stacks to implement the ''FIFO''**. |
| For the implementation, you may use classes, following the example shown in the lecture. To what extent can you use the axioms to provide //**correct**// implementations for each operation? | For the implementation, you may use classes, following the example shown in the lecture. To what extent can you use the axioms to provide //**correct**// implementations for each operation? | ||