EasyPython ProgrammingHigh School (11–12)High School (9–10)UndergraduateGeneralPython Going Further › Data StructuresConceptual
For each job, say whether a stack or a queue fits, and why.
Contributed by StemPy LabTry it on paper first. A hint, the key idea and the worked solution are here when you need them.
For each job, say whether a stack or a queue fits, and why.
- The Undo button of a text editor.
- Customers waiting at a bank counter.
- The pages that you visited in a browser, for the Back button.
- Print jobs sent to one printer.
- Checking that the brackets in a program are balanced.
- A to-do pile where you always do the newest task first.
The worked solution
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, compare your working with the solution.
Plan. Ask which item must come out next: the newest (stack) or the oldest (queue).
- Stack. Undo takes back the last change first.
- Queue. The customer who came first is served first.
- Stack. Back goes to the latest page that you left.
- Queue. Jobs are printed in the order they were sent.
- Stack. The closing bracket must match the most recent opening one.
- Stack. The newest task first is last in, first out.
Answer: stack, queue, stack, queue, stack, stack.
Discussion (0)
Log in to join the discussion.
Loading…