Big Java Late Objects
Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 16, Problem 15PE
Program Plan Intro

A method “firstToLast()”

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 “firstToLast()” to move the head of the queue to the tail of the queue,
      • Check whether the size is greater than “0”,
        • Assign the value obtained from “remove()”.
        • Call the method “add()”.
  • 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 “firstToLast()”.
      • Execute loop till queue becomes empty,
        • Print the element removed from the queue.
            • Print new line.
            • Print the expected output.

Blurred answer

Chapter 16 Solutions

Big Java Late Objects

Knowledge Booster
Background pattern image
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education