how does this work in java Design a class called Queue that implements the queue data structure. A queue isa data structure where elements are added at the end and removed from thefront (FIFO structure). Here is the UML diagram for the queue as well as thecontract description :Queue-que :double[]-front :int-back: int-numElem :int+Queue()+Queue(capacity: int)+empty():boolean+full():boolean+front(): double+pop_front(): void+push_back(value :double):void+capacity(): int;An array to store doubles in the queueTells us where the front of the queue isTells us where the back (tail) of queue isNumber of elements in the queueConstructs an empty Queue of default capacity 16Constructs an empty Queue with specified capacityReturns true if queue is emptyReturns true if queue is full ( not needed here)Returns element at front of queueRemoves element from front of queueAdds element to end (tail) of queueReturns capacity (ie length of array que)Some things to consider when you are implementing this class :1. both constructors are responsible for creating the array que. The secondconstructor must make sure that capacity is >=0. If it is not then it willcreate the array que with default size 16 ( just like the no-arg constructor).This is a perfect place to use the this pointer. Also, remember to use anamed constant for the value 16.2. Use the value of numElem to determine if the queue is empty.3. front(), like top() in the stack class, does not remove the element from thequeue.4. The queue should never fill up. If you try to add another double to thequeue and there is no room in que for that element, then allocate a newarray with twice the capacity of que, copy all elements in que to the newarray and make the new array your new que. The garbage collector will 014.5↑front = 123.437.6stXX, XX, XX..., XXRemoving from queue.4↑back = 4567XX, XX, XX, ..., XXQueue empty. Final queue capacity is : XX8numElement = 3Write a main method/class that will ask the user for some information and displaythe results as shown below. Text in bold is user input.Queue 1.0What is the initial capacity of the queue ? 5How many random numbers ? 16These 16 random numbers are being added to the queue:9

The algorithm of the code is given below: 1. Create a Scanner and Random object.2. Prompt the user…

0 1 4.5 ↑ front = 1 2 3.4 3 7.6 4 ↑ back = 4 xx, xx, xx..., xx Removing from queue. 5 6 7 8 numElement = 3 Write a main method/class that will ask the user for some information and display the results as shown below. Text in bold is user input. Queue 1.0 xx, xx, xx, ..., XX Queue empty. Final queue capacity is : XX 9 What is the initial capacity of the queue ? 5 How many random numbers ? 16 These 16 random numbers are being added to the queue:

0 1 4.5 ↑ front = 1 2 3.4 3 7.6 4 ↑ back = 4 xx, xx, xx..., xx Removing from queue. 5 6 7 8 numElement = 3 Write a main method/class that will ask the user for some information and display the results as shown below. Text in bold is user input. Queue 1.0 xx, xx, xx, ..., XX Queue empty. Final queue capacity is : XX 9 What is the initial capacity of the queue ? 5 How many random numbers ? 16 These 16 random numbers are being added to the queue:

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

What are the different types of access specifiers in Java?
What is an inner class in Java and what is its purpose?
Critically explain why you would consider array over normal data types in java
How are destructors defined in Java?
Is it possible to do type checking during the compilation of a language that uses dynamic scoping? Why? Is it feasible to do type checking in a language that uses static scoping? Why?
Can type checking be used while compiling a language with dynamic scoping? Why? Is type checking feasible in a static scoping language? Why?
Why is the size in memory of a variable of type int and the size in memory of a reference in Java is bind at Language Definition Time?
Can subprograms be overloaded?
Describe differences between inheritance and polymorphism in java.
What’s the base class in Java from which all classes are derived?