PREDICT · EXPERIMENT · EXPLAIN

Trace stacks and queues

Predict removed values and remaining entries from put/take operations.

Loading your progress…

About 10 minutes per task · No AI required
  1. 01Predict
  2. 02Experiment
  3. 03Explain
  4. 04Review
Starting experiment

Trace stacks and queues

stack, initially empty. put(A) → put(B) → take() → put(C) → take().

Rules of this learning model
  • A stack removes the newest entry; a queue removes the oldest.
  • Stacks display bottom→top; queues display head→tail. Taking from empty returns EMPTY without changing state.

Loading the experiment…

Your submitted answers and experiment position are saved only in this browser. They are shared between the Japanese and English views of the same conditions.