“LinkedQueue” class Program Plan: Filename: “LinkedQueue.java” Define “LinkedQueue” class. Declare variable for reference of first node and number of items. Default constructor for “LinkedQueue” class. Set front to “null” and count to “0”. Define the method “addToQueue()” with argument of “item”. If “front” is not equal to “null”, then Create a new node using “QueueNode” class. Create a reference to front. Performs “while” loop. This loop will repeat to obtain last node. Compute the value of next node by calling “getNextNode()” method. Set the new node at last of the queue by calling “setNextNode()” method. If the queue is empty, then Assign the next node to “null” by using “QueueNode” class. Increment the number of items. Define the method “removeFromQueue()”. If the queue is not empty, then get the element at front node by calling “getQueueElement()” method and eliminate the front node. Finally returns the resultant element. If the queue is empty, then returns null. Define the method “isEmpty()”. This method returns “true” if the value of “count” is equal to “0”. Otherwise, returns “false”. Define the method “displayQueueValues()”. Create a reference to front. Performs “while” loop. This loop will repeat to display all elements in queue. Display the element of the queue. Go to the next node by using “getNextNode()” method. Filename: “QueueNode.java” Define “QueueNode” class. Declare required variables for queue elements and next node value. Create default constructor for “QueueNode” class. Assign “null” values for queue elements and next node. Create the parameterized constructor for “QueueNode” class. Define the method “setNextNode()” which is used to set value for next node. Define the method “getNextNode()” which is used to returns the next node value. Define the method “setQueueElement()” which is used to assign value for queue elements. Define the method “getQueueElement()” which is used to returns queue elements. Filename: “LinkedQueueTest.java” Define “LinkedQueueTest” class. Define main function. Create an object “nameQueue” for “LinkedQueue” class. Add names to object “nameQueue” by using “addToQueue()” method. Call the method “displayQueueValues()” to display the elements in queue. Remove an element from the queue by calling the method “removeFromQueue()”. Display the result of whether the queue is empty or not by calling the method “isEmpty()”. Display the elements in queue after removing an element from queue by calling the method “displayQueueValues()”. Remove the elements from the queue by calling the method “removeFromQueue()”. Display the result of whether the queue is empty or not by calling the method “isEmpty()”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 11PP

Program Plan Intro

“LinkedQueue” class

Program Plan:

Filename: “LinkedQueue.java”

Define “LinkedQueue” class.

Declare variable for reference of first node and number of items.

Default constructor for “LinkedQueue” class.

Set front to “null” and count to “0”.

Define the method “addToQueue()” with argument of “item”.

If “front” is not equal to “null”, then

Create a new node using “QueueNode” class.

Create a reference to front.

Performs “while” loop. This loop will repeat to obtain last node.

Compute the value of next node by calling “getNextNode()” method.

Set the new node at last of the queue by calling “setNextNode()” method.

If the queue is empty, then

Assign the next node to “null” by using “QueueNode” class.

Increment the number of items.

Define the method “removeFromQueue()”.

If the queue is not empty, then get the element at front node by calling “getQueueElement()” method and eliminate the front node.

Finally returns the resultant element.

If the queue is empty, then returns null.

Define the method “isEmpty()”.

This method returns “true” if the value of “count” is equal to “0”. Otherwise, returns “false”.

Define the method “displayQueueValues()”.

Create a reference to front.

Performs “while” loop. This loop will repeat to display all elements in queue.

Display the element of the queue.

Go to the next node by using “getNextNode()” method.

Filename: “QueueNode.java”

Define “QueueNode” class.

Declare required variables for queue elements and next node value.

Create default constructor for “QueueNode” class.

Assign “null” values for queue elements and next node.

Create the parameterized constructor for “QueueNode” class.

Define the method “setNextNode()” which is used to set value for next node.

Define the method “getNextNode()” which is used to returns the next node value.

Define the method “setQueueElement()” which is used to assign value for queue elements.

Define the method “getQueueElement()” which is used to returns queue elements.

Filename: “LinkedQueueTest.java”

Define “LinkedQueueTest” class.

Define main function.

Create an object “nameQueue” for “LinkedQueue” class.

Add names to object “nameQueue” by using “addToQueue()” method.

Call the method “displayQueueValues()” to display the elements in queue.

Remove an element from the queue by calling the method “removeFromQueue()”.

Display the result of whether the queue is empty or not by calling the method “isEmpty()”.

Display the elements in queue after removing an element from queue by calling the method “displayQueueValues()”.

Remove the elements from the queue by calling the method “removeFromQueue()”.

Display the result of whether the queue is empty or not by calling the method “isEmpty()”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Python For this assignment, you will write a program to allow the user to store the names and phone numbers of their contacts. Create the following classes: Contact: two attributes. One for the contact's name and the contact's phone number. Node: two attributes: _data and _next. For use in a linked list. ContactList: One attribute: _head, a reference to the head of an internal linked list of Node objects. Note: self._head is an attribute of the class, so any method which updates the internal linked list can simply update the list self._head references. There is no need to return anything like we did in methods such as add_to_end in the lecture. Note also that for the same reason, we do not have to pass a reference to the head of the list to any method, because each method should already have access to the self._head attribute. ContactList should also have the following methods: add(name, new_number). Creates a new Node with a Contact object as its _data. The new Node is then added…

A business that sells dog food keeps information about its dog food products in a linked list. The list is named dogFoodList. (This means dogFoodList points to the first node in the list.) A node in the list contains the name of the dog food (a String), a dog food ID (also a String) and the price (a double.) a.) Create a class for a node in the list. b.) Use this class to write pseudocode or Java for a public method that prints the name of all dog foods in the list where the price is more than $20.00.

In c++ , write a program to create a structure of a node, create a class Linked List. Implement all operations of a linked list as member function of this class. • create_node(int); • insert_begin(); • insert_pos(); • insert_last(); • delete_pos(); • sort(); • search(); • update(); • reverse(); • display(); ( Drop coding in words with screenshot of output as well )