Chapter 16, Problem 16PE

Program Plan Intro

A method “lastToFirst()”

Program plan:

• In a file “CircularArrayQueue.java”, import necessary package, and create a class “CircularArrayQueue”,
  • Declare the necessary array.
  • Declare the necessary variables.
  • Define the constructor to create the empty queue.
  • Define the method “empty()” to check whether the queue is empty.
  • Define the method “add()” to insert the element at rear end of the queue,
    • Call the method “growBufferIfNecessary()”.
    • Increment the size.
    • Assign the new element to the rear of the queue.
    • Update the rear value.
  • Define the method “remove()” to remove the element from front end of the queue,
    • Check whether the current size is “0”,
      • Throw an exception.
        • Declare and initialize the object.
        • Update the front value.
        • Decrement the size.
        • Return the object properties.
  • Define the method “growBufferIfNecessary()”,
    • Check the condition,
      • If it is true, create an object for “Object”.
      • Create a loop,
        • Fill the object array.
      • Assign the new buffer.
      • Set the front of the queue to “0”.
      • Set the value of the rear of the queue.
  • Define the method “lastToFirst ()” to move the tail of the queue to the head of the queue,
    • Call the method “growBufferIfNecessary()”.
    • Initialize the object.
    • Create a loop,
      • Fill the array.
        • • Assign the value to the head of the queue.
• In a file “QueueTest.java”, create a class “QueueTest”,
  • Define the “main()” method.
    • Create “CircularArrayQueue” object.
    • Add the element “Jerry” to the rear end of the queue.
    • Add the element “Daniel” to the rear end of the queue.
    • Add the element “John” to the rear end of the queue.
    • Call the method “lastToFirst()”.
    • Execute loop till queue becomes empty,
      • Print the element removed from the queue.
        • • Print new line.
          • Print the expected output.