import java.util.Map; import java.util.TreeMap; public class Maps {    /**       Returns a new map with common key-value pairs.       @param map1 the first map to compare       @param map2 the second map to compare       @return a map containing entries common to both maps    */    public static Map getCommon(Map map1,          Map map2)    {       Map common = new TreeMap<>();       /*  code goes here */       return common

Java Code:  Create a Parser class. Much like the Lexer, it has a constructor that accepts a LinkedList of Token and creates a TokenManager that is a private member. The next thing that we will build is a helper method – boolean AcceptSeperators(). One thing that is always tricky in parsing languages is that people can put empty lines anywhere they want in their code. Since the parser expects specific tokens in specific places, it happens frequently that we want to say, “there HAS to be a “;” or a new line, but there can be more than one”. That’s what this function does – it accepts any number of separators (newline or semi-colon) and returns true if it finds at least one. Create a Parse method that returns a ProgramNode. While there are more tokens in the TokenManager, it should loop calling two other methods – ParseFunction() and ParseAction(). If neither one is true, it should throw an exception. bool ParseFunction(ProgramNode) bool ParseAction(ProgramNode) -Creates ProgramNode,…

/** * This class will use Nodes to form a linked list. It implements the LIFO * (Last In First Out) methodology to reverse the input string. * **/   public class LLStack {            private Node head;            // Constructor with no parameters for outer class      public LLStack( ) {          // to do      }            // This is an inner class specifically utilized for LLStack class,      // thus no setter or getters are needed      private class Node  {         private Object data;         private Node next;                  // Constructor with no parameters for inner class         public Node(){             // to do             // to do         }        // Parametrized constructor for inner class         public Node (Object newData, Node nextLink) {                 // to do: Data part of Node is an Object                // to do:  Link to next node is a type Node         }      }             // Adds a node as the first node element at the start of the list with the specified…

Implement a Single linked list to store a set of Integer numbers (no duplicate) • Instance variable• Constructor• Accessor and Update methods 2.) Define SLinkedList Classa. Instance Variables:     # Node head     # Node tail     # int sizeb. Constructorc. Methods     # int getSize() //Return the number of nodes of the list.     # boolean isEmpty() //Return true if the list is empty, and false otherwise.     # int getFirst() //Return the value of the first node of the list.     # int getLast()/ /Return the value of the Last node of the list.     # Node getHead()/ /Return the head     # setHead(Node h)//Set the head     # Node getTail()/ /Return the tail     # setTail(Node t)//Set the tail     # addFirst(E e) //add a new element to the front of the list     # addLast(E e) // add new element to the end of the list     # E removeFirst()//Return the value of the first node of the list     # display()/ /print out values of all the nodes of the list     # Node search(E key)//check if a given…

#include <iostream> usingnamespace std; class Queue {     int size;     int* queue;         public:     Queue(){         size = 0;         queue = new int[100];     }     void add(int data){         queue[size]= data;         size++;     }     void remove(){         if(size ==0){             cout <<"Queue is empty"<<endl;             return;         }         else{             for(int i =0; i < size -1; i++){                 queue[i]= queue[i +1];             }             size--;         }     }     void print(){         if(size ==0){             cout <<"Queue is empty"<<endl;             return;         }         for(int i =0; i < size; i++){             cout<<queue[i]<<" <- ";         }         cout << endl;     }     //your code goes here     }; int main(){     Queue q1;     q1.add(42); q1.add(2); q1.add(8);  q1.add(1);     Queue q2;     q2.add(3); q2.add(66); q2.add(128);  q2.add(5);     Queue q3 = q1+q2;     q3.print();…

A map is a container that stores a collection of ordered pairs, each pair consists of a key and a value, <key, value>. Keys must be unique. Values need not be unique, so several keys can map to the same values. The pairs in the map are sorted based on keys. Group of answer choices True False

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

Please fill in the code gaps if possible. This problem has been giving me trouble. Any help is appreciated.  public class Node {       private String element; // we assume elements are character strings         private Node next;  /* Creates a node with the given element and next node. */ public Node(String s, Node n) {  //fill in body  }  /* Returns the element of this node. */ public String getElement() {  //fill in body  }  /* Returns the next node of this node. */ public Node getNext() {  //fill in body  }  // Modifier methods:  /* Sets the element of this node. */ public void setElement(String newElem) {  //fill in body  }  /* Sets the next node of this node. */ public void setNext(Node newNext) {  //fill in body  } }

Computer Science PLEASE HELP TO CONVERT THIS FOR LOOP TO FOREACH LOOP     using System;using System.Collections.Generic; namespace SwinAdventure{public class IdentifierableObject{//field ,datapublic List<string> Identifier = new List<string>(); //constructorpublic IdentifierableObject(string[] ident){for (int i = 0; i < ident.Length; i++){Identifier.Add(ident[i]);}} // Methodpublic void AddIdentifier(string id){Identifier.Add(id.ToLower());} // propertiespublic string FirstID{get{return Identifier[0];}} public bool AreYou(string id){for (int i = 0; i < Identifier.Count; i++){if (Identifier[i] == id.ToLower()){return true;} }return false;}}}

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]);…