Write an abstract data type for a queue whose elements include both a 20-character string and an integer priority. This queue must have the following methods: enqueue, which takes a string and an integer as parameters; dequeue, which returns the string from the queue that has the highest priority; and empty. The queue is not to be maintained in priority order of its elements, so the dequeue operation must always search the whole queue.

Design an implementation of an Abstract Data Type consisting of a set with the following operations: insert(S, x) Insert x into the set S. delete(S, x) Delete x fromthe set S. member(S, x) Return true if x ∈ S, false otherwise. position(S, x) Return the number of elements of S less than x. concatenate(S, T) Set S to the union of S and T, assuming every element in S is smaller than every element of T. All operations involving n-element sets are to take time O(log n).

In Java. The following is a class definition of a linked list Node:class Node{int info;Node next;}Show the instructions required to create a linked list that is referenced by head and stores in order, the int values 13, 6 and 2.  Assume that Node's constructor receives no parameters.

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…

Given the following specification of a front operation for queue:ItemType Front Function: Returns a copy of the front item on the queue. Precondition: Queue is not empty. Postcondition: Queue is not changed. 1. Write this operation as client code, using operations from the QueType class. (Remember,the client code has no access to the private variables of the class). 2. Write this function as a new member function of the QueType class.   help me with complete code

You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…

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 (); }

Add the following method in the BST class that returns aniterator for traversing the elements in a BST in preorder./** Return an iterator for traversing the elements in preorder */java.util.Iterator<E> preorderIterator()