Creates a class Queue and performs enqueue and dequeue operations Program Plan: Define the required public class definition. Define the main function in the class using public static void main(String[] args). Create the objects and pass the required arguments. Declare for loop. Declare the required queue. Declare while loop. Print the data field using System.out.println(). Close the main function. Close the public class definition. Define the required class definition. Declare the required private data fields. Construct the required queue. Add the new integer to the queue using enqueue(). Declare if statement. Remove the element from the queue using dequeue(). Declare for loop. Check whether the queue is empty. Return the required value. Get the size of the queue. Return the required value. Close the public class definition.

Question

Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained. You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data; Node next; Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function…

Answer 1

Question

Chapter 10, Problem 10.10PE

Program Plan Intro

Creates a class Queue and performs enqueue and dequeue operations

Program Plan:

Define the required public class definition.

Define the main function in the class using public static void main(String[] args).

Create the objects and pass the required arguments.

Declare for loop.

Declare the required queue.

Declare while loop.

Print the data field using System.out.println().

Close the main function.

Close the public class definition.

Define the required class definition.

Declare the required private data fields.

Construct the required queue.

Add the new integer to the queue using enqueue().

Declare if statement.

Remove the element from the queue using dequeue().

Declare for loop.

Check whether the queue is empty.

Return the required value.

Get the size of the queue.

Return the required value.

Close the public class definition.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained. You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data; Node next; Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function…

In C++ Please

1. Stack Implementation Write a method called insert for the class Stack. The method shall be implemented using an array-based structure. You can assume that String[] stack is defined in the class, which is responsible to store the elements and responsible to enforce the order of first-in last-out, a.k.a., FIFO. Additionally, you can assume there is a pointer called top, that indicates the position of the top of the stack, pointing to the next available position to insert. The method shall: • take a String s as a parameter, and shall add it at the top of the stack. shall return true if the element s was added successfully at the top of the stack, false otherwise. . . The method must check boundaries of capacity and limitation of the Stack. In case the method is invoked to insert an element of the top of the stack that exceeds its current capacity, the method shall handle the situation properly. Do not provide the entire Stack implementation, only the code solution of the method.