A method “lastToFirst()” Program plan: In a file “LinkedListQueue.java”, import necessary package, and create a class “LinkedListQueue”, Declare the necessary “Node” object 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, Check whether the rear end of the queue contains null value, If it is true, create an object for “Node”. Assign the new element to the node. Assign the null value the next node. Assign the new node value to the rear element. Assign the new node value to the front end element. Otherwise, If it is true, create an object for “Node”. Assign the element to the node. Assign the null value to the node next to the new node. Set the new element to the rear end element. Set the new element to the rear end element. Define the method “remove()” to remove the element from front end of the queue, Check whether the front end of the queue contains null value, If it is true, return null value. Initialize the object. Assign the element next to front element to the front end of the queue. Check whether the rear end of the queue contains null value, If it is true, assign the null value to rear end of the queue. Return the element. Define the method “lastToFirst ()” to move the tail of the queue to the head of the queue, Check whether the rear end and front end element is not same. If it is true, initialize the “Node” object. Set the head of the queue to the node next to rear of the queue. Assign the rear element to the front element. Execute till the value becomes null, Check the condition, If it is true, set the null value to the element next to check element. Set the check element to the rear element. Set the next element to the check element. Create a class “Node”, Declare the object for “Object” and “Node”. In a file “QueueTest.java”, create a class “QueueTest”, Define the “main()” method. Create “LinkedListQueue” 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.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, Problem 14PE

Program Plan Intro

A method “lastToFirst()”

Program plan:

In a file “LinkedListQueue.java”, import necessary package, and create a class “LinkedListQueue”,

Declare the necessary “Node” object 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,

Check whether the rear end of the queue contains null value,

If it is true, create an object for “Node”.

Assign the new element to the node.

Assign the null value the next node.

Assign the new node value to the rear element.

Assign the new node value to the front end element.

Otherwise,

If it is true, create an object for “Node”.

Assign the element to the node.

Assign the null value to the node next to the new node.

Set the new element to the rear end element.

Set the new element to the rear end element.

Define the method “remove()” to remove the element from front end of the queue,

Check whether the front end of the queue contains null value,

If it is true, return null value.

Initialize the object.

Assign the element next to front element to the front end of the queue.

Check whether the rear end of the queue contains null value,

If it is true, assign the null value to rear end of the queue.

Return the element.

Define the method “lastToFirst ()” to move the tail of the queue to the head of the queue,

Check whether the rear end and front end element is not same.

If it is true, initialize the “Node” object.

Set the head of the queue to the node next to rear of the queue.

Assign the rear element to the front element.

Execute till the value becomes null,

Check the condition,

If it is true, set the null value to the element next to check element.

Set the check element to the rear element.

Set the next element to the check element.

Create a class “Node”,

Declare the object for “Object” and “Node”.

In a file “QueueTest.java”, create a class “QueueTest”,

Define the “main()” method.

Create “LinkedListQueue” 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.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

If a UDP datagram is sent from host A, port P to host B, port Q, but at host B there is no process listening to port Q, then B is to send back an ICMP Port Unreachable message to A. Like all ICMP messages, this is addressed to A as a whole, not to port P on A. (a) Give an example of when an application might want to receive such ICMP messages. (b) Find out what an application has to do, on the operating system of your choice, to receive such messages. (c) Why might it not be a good idea to send such messages directly back to the originating port P on A?

Discuss how business intelligence and data visualization work together to help decision-makers and data users. Provide 2 specific use cases.

This week we will be building a regression model conceptually for our discussion assignment. Consider your current workplace (or previous/future workplace if not currently working) and answer the following set of questions. Expand where needed to help others understand your thinking: What is the most important factor (variable) that needs to be predicted accurately at work? Why? Justify its selection as your dependent variable.