Queue example – make this generic, instead of a Queue of Customer. public class Queue {      private ArrayList line;   public Queue() {      line = null; }   public void enqueue (Customer c) {      Customer newc = new Customer (c);     // copy constructor plateful.add(newc);        }   public Customer dequeue (Customer c) {      Customer newc = line.get(0); plateful.remove(0); return newc; } }  // end of class definition

Redesign LaptopList class from previous project public class LaptopList {       private class LaptopNode  //inner class     {         public String brand;         public double price;         public LaptopNode next;           public LaptopNode(String brand, double price)         {                // add your code         }         public String toString()         {             // add your code         }     }       private LaptopNode head; // head of the linked list       public LaptopList(String fname) throws IOException     {         File file = new File(fname);         Scanner scan = new Scanner(file);         head = null;         while(scan.hasNextLine())         {             // scan data             // create LaptopNode             // call addToHead and addToTail alternatively          }     }       private void addToHead(LaptopNode node)     {             // add your code     }       private void addToTail(LaptopNode node)     {             // add your code     }       private…

class Queue {      private static int front, rear, capacity; private static int queue[];  Queue(int c) {  front = rear = 0;  capacity = c;  queue = new int[capacity]; }  static void queueEnqueue(int data) {   if (capacity == rear) {   System.out.printf("\nQueue is full\n");   return;  }     else {   queue[rear] = data;   rear++;  }  return; }  static void queueDequeue() {    if (front == rear) {   System.out.printf("\nQueue is empty\n");   return;  }   else {   for (int i = 0; i < rear - 1; i++) {    queue[i] = queue[i + 1];   }       if (rear < capacity)    queue[rear] = 0;       rear--;  }  return; }   static void queueDisplay() {  int i;  if (front == rear) {   System.out.printf("\nQueue is Empty\n");   return;  }     for (i = front; i < rear; i++) {   System.out.printf(" %d <-- ", queue[i]);  }  return; }   static void queueFront() {  if (front == rear) {   System.out.printf("\nQueue is Empty\n");   return;  }  System.out.printf("\nFront Element is: %d", queue[front]);…

Help pls: Write the definitions of the following functions: getRemainingTransactionTime setCurrentCustomer getCurrentCustomerNumber getCurrentCustomerArrivalTime getCurrentCustomerWaitingTime getCurrentCustomerTransactionTime of the class serverType defined in the section Application of Queues: Simulation. serverType::serverType() {     status = "free";     transactionTime = 0; } bool serverType::isFree() const {     return (status == "free"); } void serverType::setBusy() {     status = "busy"; } void serverType::setFree() {     status = "free"; } void serverType::setTransactionTime(int t) {     transactionTime = t; } void serverType::setTransactionTime() {     //TODO: uncomment once getTransactionTime is defined     /*     int time;          time = currentCustomer.getTransactionTime();     transactionTime = time;     */ } void serverType::decreaseTransactionTime() {     transactionTime--; }

Parser - setup Make sure to make a Parser class (does not derive from anything). It must have a constructor that accepts your collection of Tokens. We will be treating the collection of tokens as a queue - taking off the front. It isn't necessary to use a Java Queue, but you may. We will add three helper functions to parser. These should be private: matchAndRemove - accepts a token type. Looks at the next token in the collection: If the passed in token type matches the next token's type, remove that token and return it. If the passed in token type DOES NOT match the next token's type (or there are no more tokens) return null. expectEndsOfLine - uses matchAndRemove to match and discard one or more ENDOFLINE tokens. Throw a SyntaxErrorException if no ENDOFLINE was found. peek - accepts an integer and looks ahead that many tokens and returns that token. Returns null if there aren't enough tokens to fulfill the request. Parser - parse Make sure to make a public parse method. There are no…

Problem 7: Assume that a queue class called XQueue has a no argument constructor, an enqueue() method, a dequeue() method and an isEmpty() method. Write a method that merges two given queues by copying the elements in an alternating sequence and returning the resulting combined queue. Note: make sure that you don't include unnecessary spaces in your answer! public XQueue merge(XQueue q1, XQueue q2) { XQueue neWQueue = new XQueue(); while (!q1.isEmpty() && !q2.isEmpty()) { newQueue.enqueue( #01 ); newQueue.enqueue( #02); } while (!q1.isEmpty()) { #03 ; } while (!q2.is Empty()) { #04 ; } return newQueue (); }

Please complete the code and make sure it runs package chapter04.queues;


public class LinkedQueue
{
   protected PersonNode front;
   protected PersonNode rear;
   protected int numElements;
   
   public LinkedQueue()
   {
      front = null;
      rear = null;
      numElements = 0;
   }

   public void enqueue(T fName, T lName, T sNum)
   {
      //Complete this method as required in the homework instructions.



   }


   public T dequeue()
   {
      //Complete this method as required in the homework instructions.




   }
   
   public void peekFront()
   {
      //Complete this method as required in the homework instructions.   }

   public boolean contains(T lookFor)
   {
      //Complete this method as required in the homework instructions.



   }

   public void display()
   {
      //Complete this method as required in the homework instructions.



   }

   public int size()
   {
      return numElements;
   }

   public boolean isFull()
   {
      return false;…

package circularlinkedlist;import java.util.Iterator; public class CircularLinkedList<E> implements Iterable<E> { // Your variablesNode<E> head;Node<E> tail;int size; // BE SURE TO KEEP TRACK OF THE SIZE // implement this constructorpublic CircularLinkedList() {} // I highly recommend using this helper method// Return Node<E> found at the specified index// be sure to handle out of bounds casesprivate Node<E> getNode(int index ) { return null;} // attach a node to the end of the listpublic boolean add(E item) {this.add(size,item);return false; } // Cases to handle// out of bounds// adding to empty list// adding to front// adding to "end"// adding anywhere else// REMEMBER TO INCREMENT THE SIZEpublic void add(int index, E item){ }   // remove must handle the following cases// out of bounds// removing the only thing in the list// removing the first thing in the list (need to adjust the last thing in the list to point to the beginning)// removing the last…

Simple linkedlist implementation please help (looks like a lot but actually isnt, everything is already set up for you below to make it EVEN easier) help in any part you can be clear Given an interface for LinkedList- Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of LinkedList interface provided- For the implementation create a tester to verify the implementation of thatdata structure performs as expected Build Bus Route – Linked List- You’ll be provided a java package containing an interface, data structure,implementation shell, test harness shell below.- Your task is to:o Implement the LinkedList interface (fill out the implementation shell)o Put your implementation through its paces by exercising each of themethods in the test harnesso Create a client (a class with a main) ‘BusClient’ which builds a busroute by performing the following operations on your linked list:o§ Create (insert) 4 stations§…

import java.util.*;import java.io.*; public class HuffmanCode {     private Queue<HuffmanNode> queue;        private HuffmanNode overallRoot;                 public HuffmanCode(int[] frequencies) {                queue = new PriorityQueue<HuffmanNode>();                                for (int i = 0; i < frequencies.length; i++) {                        if (frequencies[i] > 0) {                                HuffmanNode node = new HuffmanNode(frequencies[i]);                                node.ascii = i;                                queue.add(node);                        }                }                overallRoot = buildTree();              }                 public HuffmanCode(Scanner input) {                overallRoot = new HuffmanNode(-1);                while (input.hasNext()) {                        int asciiValue = Integer.parseInt(input.nextLine());                        String code = input.nextLine();                        overallRoot =…