A collection cannot be represented by a linked list. This is a set data structure that has absolutely no values. There are no similarities between the two sets. Sets are relevant to mathematical set functions like union and intersection.

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.

Assume you have a class SLNode representing a node in a singly-linked list and a variable called list referencing the first element on a list of integers, as shown below: public class SLNode { private E data; private SLNode next; public SLNode( E e){ data = e; next = null; } public SLNode getNext() { return next; } public void setNext( SLNoden){ next = n; } } SLNode list; Write a fragment of Java code that would append a new node with data value 21 at the end of the list. Assume that you don't know if the list has any elements in it or not (i.e., it may be empty). Do not write a complete method, but just show a necessary fragment of code.

1. Write code to define LinkedQueue<T> and CircularArrayQueue<T> classes which willimplement QueueADT<T> interface. Note that LinkedQueue<T> and CircularArrayQueue<T>will use linked structure and circular array structure, respectively, to define the followingmethods.(i) public void enqueue(T element); //Add an element at the rear of a queue(ii) public T dequeue(); //Remove and return the front element of the queue(iii) public T first(); //return the front element of the queue without removing it(iv) public boolean isEmpty(); //Return True if the queue is empty(v) public int size(); //Return the number of elements in the queue(vi) public String toString();//Print all the elements of the queuea. Create an object of LinkedQueue<String> class and then add some names of your friendsin the queue and perform some dequeue operations. At the end, check the queue sizeand print the entire queue.b. Create an object from CircularArrayQueue<T> class and…

Computer science help

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).

DisjointSet Class    Implementation of this class is done in a1_partc.py A DisjointSet class represents a disjoint set which is a set of sets where every element can only belong to exactly one set. When a DisjointSet class is instantiated it is passed nothing and contains no sets. It make an empty Python dictionary which will be used to store the elements of the DisjointSet. The DisjointSet has the following member functions: def make_set(self,element) If element already exists within the Disjoint set, the function does nothing and returns false. If element does not exist in the DisjointSet, this function will add it to the DisjointSet by: make a new SetList object containing only one node, with the element as only value in the SetList adding a new dictionary entry where element is the key and a reference to the node containing element as the value return true Suppose we ran the following code:     ds = DisjointSet()    ds.make_set("cat")    ds.make_set("dog")    ds.make_set("fish")…

Design a class namedQueue for storing integers. Like a stack, a queue holds elements. In a stack, theelements are retrieved in a last-in first-out fashion. In a queue, the elements areretrieved in a first-in first-out fashion. The class contains:■■ An int[] data field named elements that stores the int values in the queue.■■ A data field named size that stores the number of elements in the queue.■■ A constructor that creates a Queue object with default capacity 8.■■ The method enqueue(int v) that adds v into the queue. ■■ The method dequeue() that removes and returns the element from thequeue.■■ The method empty() that returns true if the queue is empty.■■ The method getSize() that returns the size of the queue.Draw an UML diagram for the class. Implement the class with the initial arraysize set to 8. The array size will be doubled once the number of the elementsexceeds the size. After an element is removed from the beginning of the array,you need to shift all elements in the array one…

Send me your own work not AI generated response or plagiarised response. If I see these things, I'll give multiple downvotes and will definitely report.

complete all the implementation of the member functions listed in the class interface for the following header file. #ifndef _LINKEDSTACK#define _LINKEDSTACK #includeusing namespace std;templateclass LinkedStack{private:Node *top;   Node *getCurrentTop() {       return top;   }public:   Stack();   bool isEmpty();   bool push(ItemType newItem);   bool pop();   ItemType peek();   void clean();   bool display();};#endif