Implement a Doubly linked list to store a set of Integer numbers (no duplicate) Using Java • Instance variable • Constructor • Accessor and Update methods 1. Define a Node Class. a. Instance Variables      # E element - (generics framework)      # Node next (pointer) - refer to the next node (Self-referential)      # Node prev (pointer) - refer to the previous node (Self-referential) b. Constructor c. Methods      # E getElement() //Return the value of this node.      # setElement(E e) // Set value to this node.      # Node getNext() //Return the next pointer of this node.      # setNext(Node n) //Set the next pointer to this node.      # Node getPrev() //Return the pointer of this node.      # setPrev(Node n) //Set the previous pointer to this node.      # displayNode() //Display the value of this node.

1. Follow the class instruction and complete the Cat class. Create class Cat a. Add properties: i. What characteristics do they have? Name, age, color, type (domestic / feral), etc. (secure the data) ii. What color(s) might they have? White, cream, fawn, Cinnamon, Chocolate, Red, Lilac, Blue, Black, Lavender, etc. b. Add methods: eat()), play(), etc. c. Constructors? i. A class provides a special type of methods, known as constructors, which are invoked to construct objects from the class ii. Create 2 different constructor with different initialization parameters d. How to get the number of cats? Add a static variable and a static method to print out the number of cats. e. Test Cat class by creating 3 Cat instances: i. Each cat should have different properties. ii. Test all the methods. iii. Print out the number of cats. 2. Define a BankAccount class that has: accNum (int) Balance (double) ● a constructor four methods: o deposit() withdraw() O o getAccNum() o getBalance() Implement a…

Given main(), complete the program to add people to a queue. The program should read in a list of people's names including "You" (ending with -1), adding each person to the peoplelnQueue queue. Then, remove each person from the queue until "You" is at the head of the queue. Include print statements as shown in the example below. Ex. If the input is Zadie Smith Tom Sawyer You Louisa Alcott the output is Welcome to the ticketing service... You are number 3 in the queue. Zadie Smith has purchased a ticket. You are now number 2 Tom Sawyer has purchased a ticket. You are now number 1 You can now purchase your ticket!

Could you help me the following question?   The Node structure is defined as follows (we will use integers for data elements):   public class Node {             public int data;             public Node next;             public Node previous; }   The Double Ended Doubly Linked List (DEDLL) class definition is as follows:   public class DEDLL {             public int currentSize;             public Node head;             public Node tail; }   This design is a modification of the standard linked list. In the standard that we discussed in class, there is only a head node that represents the first node in the list and each node only contains a reference to the next node in the list until the chain of nodes reach null. In this DEDLL, each node also has a reference to the previous node. The DEDLL also contains a reference to the tail of the list that represents the last node in the list.   For example, a DEDLL with 4 elements may have nodes with values 5, 2, 6, and 8 from head to tail. This…

don't use others answers java 1. Write a generic static method that takes a Stack of any type element as a parameter, pops each element from the stack, and prints it. It should have a type parameter that represents the Stack’s element type.

3. Define a Pair class using Java Generics framework a. Properties: first, second b. Constructors: Create 2 different constructor with different initialization parameters c. Methods: setFirst(), setSecond(), getFirst(), getSecond(); d. Test Pair class print out the value of Pair instance: i. Define a Pair instance and assign (10,10.1) to the pair; ii. Define a Pair instance and assign (8.2, "ABC") to the pair; iii. Define an array holding[] of Pair class. 1. holding has 100 elements; 2. Assign (int, double) to array by using loop -> (0, 100.0), (1, 99.0), (2, 98.0), ..., (99, 1.0).

import java.util.HashSet; import java.util.Set; // Define a class named LinearSearchSet public class LinearSearchSet {     // Define a method named linearSearch that takes in a Set and an integer target     // as parameters     public static boolean linearSearch(Set<Integer> set, int target) {         // Iterate over all elements in the Set         for () {             // Check if the current value is equal to the target             if () {                 // If so, return true             }         }         // If the target was not found, return false     }     // Define the main method     public static void main(String[] args) {         // Create a HashSet of integers and populate integer values         Set<Integer> numbers = new HashSet<>();         // Define the target to search for         numbers.add(3);         numbers.add(6);         numbers.add(2);         numbers.add(9);         numbers.add(11);         // Call the linearSearch method with the set…

Write a Java program for a matrix class that can add and multiply arbitrary two dimensional arrays of integers. Textbook Project P-3.36, pp. 147 Implement Singly Linked List - use textbook Chapter 3.2 as an exaple. Write a main driver to test basic list implementations. Textbook reference : Data structures and algorithms in Java Micheal Goodrich

1. Complete the function evaluate_postfix(String exp):   Input: "10 23 - 5 15 + +" Retur: 7   Node.java public class Node {Object info;Node next;Node(Object info, Node next){this.info=info;this.next=next;}}// "((1+2)"// ['(','(','1','+','2',')']// stack : ')' -> '2' -> '1' -> '(' -> '(' -> null   Stack.java public class Stack {private Node top;public Stack() {top = null;}public boolean isEmpty() {return (top == null);}public void push(Object newItem) {top = new Node(newItem, top);}public Object pop() {if (isEmpty()) {System.out.println("Trying to pop when stack is empty");return null;} else {Node temp = top;top = top.next;return temp.info;}}void popAll() {top = null;}public Object peek() {if (isEmpty()) {System.out.println("Trying to peek when stack is empty");return null;} else {return top.info;}}}   Runner.java public class Runner {public static void main(String[] args) {String expression1 = "((1+2)))))+(2+2))(1/2)";boolean res =…

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…