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

Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal. Create 2 groups: marketing and research. Add Shamir, Jose, and Kate to the marketing group. Add Don, Liz, and Sal to the research group. Create a shared directory for each group. Create two files to put into each directory: spreadsheetJanuary.txt meetingNotes.txt Assign access permissions to the directories: Groups should have Read+Write access Leave owner permissions as they are “Everyone else” should not have any access Submit for grade: Screenshot of /etc/passwd contents showing your new users Screenshot of /etc/group contents showing new groups with their members Screenshot of shared directories you created with files and permissions

⚫ your circuit diagrams for your basic bricks, such as AND, OR, XOR gates and 1 bit multiplexers, ⚫ your circuit diagrams for your extended full adder, designed in Section 1 and ⚫ your circuit diagrams for your 8-bit arithmetical-logical unit, designed in Section 2. 1 An Extended Full Adder In this Section, we are going to design an extended full adder circuit (EFA). That EFA takes 6 one bit inputs: aj, bj, Cin, Tin, t₁ and to. Depending on the four possible combinations of values on t₁ and to, the EFA produces 3 one bit outputs: sj, Cout and rout. The EFA can be specified in principle by a truth table with 26 = 64 entries and 3 outputs. However, as the EFA ignores certain inputs in certain cases, it is easier to work with the following overview specification, depending only on t₁ and to in the first place: t₁ to Description 00 Output Relationship Ignored Inputs Addition Mode 2 Coutsjaj + bj + Cin, Tout= 0 Tin 0 1 Shift Left Mode Sj = Cin, Cout=bj, rout = 0 rin, aj 10 1 1 Shift Right…

Show the correct stereochemistry when needed!! mechanism: mechanism: Show the correct stereochemistry when needed!! Br NaOPh diethyl ether substitution