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

Objective: 1. Implement a custom Vector class in C++ that manages dynamic memory efficiently. 2. Demonstrate an understanding of the Big Five by managing deep copies, move semantics, and resource cleanup. 3. Explore the performance trade-offs between heap and stack allocation. Task Description: Part 1: Custom Vector Implementation 1. Create a Vector class that manages a dynamically allocated array. 。 Member Variables: ° T✶ data; // Dynamically allocated array for storage. std::size_t size; // Number of elements currently in the vector. std::size_t capacity; // Maximum number of elements before reallocation is required. 2. Implement the following core member functions: Default Constructor: Initialize an empty vector with no allocated storage. 。 Destructor: Free any dynamically allocated memory. 。 Copy Constructor: Perform a deep copy of the data array. 。 Copy Assignment Operator: Free existing resources and perform a deep copy. Move Constructor: Transfer ownership of the data array…

2.68♦♦ Write code for a function with the following prototype: * Mask with least signficant n bits set to 1 * Examples: n = 6 -> 0x3F, n = 17-> 0x1FFFF * Assume 1 <= n <= w int lower_one_mask (int n); Your function should follow the bit-level integer coding rules Be careful of the case n = W.

Hi-Volt Components You are the IT manager at Hi-Voltage Components, a medium-sized firm that makes specialized circuit boards. Hi-Voltage's largest customer, Green Industries, recently installed a computerized purchasing sys- tem. If Hi-Voltage connects to the purchasing system, Green Industries will be able to submit purchase orders electronically. Although Hi-Voltage has a computerized accounting system, that system is not capable of handling EDI. Tasks 1. What options does Hi-Voltage have for developing a system to connect with Green Industries' pur- chasing system? 2. What terms or concepts describe the proposed computer-to-computer relationship between Hi-Voltage and Green Industries? why not? 3. Would Hi-Voltage's proposed new system be a transaction processing system? Why or 4. Before Hi-Voltage makes a final decision, should the company consider an ERP system? Why or why not?