You may refer to the Floating Front Design algorithm (discussed in Queue and in code) for this
Question:
You may refer to the Floating Front Design algorithm (discussed in Queue and in code) for this problem where both front and back are array indices from 0 to array.size()-1. Q is an initially empty circular array-based QUEUE of size 8. After each statement on left has been evaluated, please enter the resulting values of the front and back on right (HINT: please refrain from guessing based on intuition and, instead, reference code in your Queue lecture for insight):
ArrayQueue Q = new ArrayQueue (8); front = ; back =
Q.enqueue("P"); front = ; back =
char x = Q.dequeue(); front = ; back =
Q.enqueue("C"); front = ; back =
Q.enqueue("c"); front = ; back =
Q.enqueue("C"); front = ; back =
Q.peek(); front = ; back =
Q.dequeue(); front = ; back =
Financial Accounting
ISBN: 978-1259307959
4th edition
Authors: David Spiceland, Wayne Thomas, Don Herrmann