You learn in class as well as in reading about the Array-Based Queue Implementations, specifically the "Floating Front Design" to implement a queue using a fixed-size array. The following two scenarios from your lecture slides illustrate how this design works:

Scenario #1

8:09 7 online.smc.edu (a) queue . enqueue ('A' ) A front : 0 rear : O [0] [1] [2] [3] [4] (b) queue . enqueue ('B' ) A B front : 0 rear : 1 [o] [1] [2] [3] [4] (c) queue . enqueue ( 'C' ) A B C front : 0 rear : 2 [0] [1] [2] [3] [4] (d) element=queue . dequeue ( ) ; B C front : rear : 2 [O] [1] [2] [3] [4] Scenario #2 (a) There is no room at the end of the array K L? front : 3 rear : 5? [0] [1] [2] [3] [4] (b) Using the array as a circular structure, we can wrap the queue around to the beginning of the array K front : 3 rear: 0 [o] [1] [2] [3] [4]