CS 2401 Quiz #8

• Show, step by step, how we can use a stack to compute the value of the following arithmetic expression in postfix: 567*+8-
• Show, step by step, how a queue implemented as a circular array will look after the following sequence of operations:

  initialize();
  enqueue(5);
  enqueue(6);
  dequeue();
  enqueue(7);
  enqueue(8);
  dequeue();
  enqueue(1);
  enqueue(2);
  

  assume that we use arrays of size 4.