Question

can i please get help on this? i don't know how to do it and I'm so confused. This is in java. This is what I need to do. Thank you so much.

In this lab assignment, you are to write a class IntegerSet that represents a set of integers (by definition, a set contains no duplicates). This ADT must be implemented as a singly linked list of integers
(with no tail reference and no dummy head node)
, but it need not be sorted.
The IntegerSet class should have two data fields: the cardinality (size) of the set, and the head reference to the linked list. It should provide the following public methods:
IntegerSet(int size): this constructor method creates a new set of size integers by prompting the user to enter size elements for the set on the keyboard.
int size(): this method returns the cardinality of the set.
boolean isEmpty(): this method returns true if the set has no elements, false otherwise.
boolean isMember(int item): this method returns true if item is an element of the set, false otherwise.
boolean add(int item): if item is not in the set, this method adds it to the set and returns true; otherwise, the set is unchanged and the method returns false.
boolean remove(int item): if item is in the set, this method removes it from the set and returns true; otherwise, the set is unchanged and the method returns false.
boolean isSubset(IntegerSet set2): this method returns true if every element in set2 is also in the calling set, false otherwise.
IntegerSet intersection(IntegerSet set2): this method returns a new set that is the intersection of the calling set and set2. An integer is an element of the intersection set if it is in both the calling set and set2.
IntegerSet union(IntegerSet set2): this method returns a new set that is the union of the calling set and set2. An integer is an element of the union set if it is in either the calling set or set2, or both. Keep in mind that the union set formed should not contain any duplicates.
IntegerSet difference(IntegerSet set2): this method returns a new set that is the difference between the calling set and set2 (in this order). An integer is an element of the difference set if it is in the calling set but not in set2.
void display(): this method prints all elements of the set on the screen.
In addition to the IntegerSet class, you are also required to write a test driver that serves as the test harness for the IntegerSet class. This test harness should provide the user with options to explicitly test each method in the IntegerSet class.

Answer 1

//IntegerSet.java

import java.util.Scanner;

public class IntegerSet {

      

       class Node

       {

             public int data;

             public Node next;

       }

      

       private int size;

       private Node head;

      

       public IntegerSet(int size)

       {

             this.size = 0;

             head = null;

             if(size > 0)

                    inputData(size);

       }

      

       private void inputData(int size)

       {

             int num;

             Scanner scan = new Scanner(System.in);

            

                    System.out.println("Enter "+size+" elements of the set :");

                    for(int i=0;i<size;i++)

                    {

                           System.out.print("Enter element : ");

                           num = scan.nextInt();

                           if(!add(num))

                           {

                                 System.out.println(num+" exists in Set");

                                 i--;

                           }

                          

                    }

       }

      

       public int getSize()

       {

             return size;

       }

      

       public boolean isEmpty()

       {

             return(size == 0);

       }

      

       public boolean isMember(int item)

       {

             if(isEmpty())

                    return false;

             Node curr = head;

             while(curr != null)

             {

                    if(curr.data == item)

                           return true;

                    curr = curr.next;

             }

            

             return false;

       }

      

       public boolean add(int item)

       {

             if(isMember(item))

                    return false;

             Node node = new Node();

             node.data = item;

             node.next = head;

             head = node;

             size++;

             return true;

       }

      

       public boolean remove(int item)

       {

             if(isMember(item))

             {

                    if(head.data == item)

                    {

                           head = head.next;

                           size--;

                           return true;

                    }

                    else

                    {

                           Node curr = head;

                           Node prev = null;

                           while(curr != null)

                           {

                                 if(curr.data == item)

                                 {

                                        prev.next = curr.next;

                                        size--;

                                        return true;

                                 }

                                 prev = curr;

                                 curr = curr.next;

                           }

                    }

             }

            

             return false;

       }

      

       public boolean isSubset(IntegerSet set2)

       {

             Node curr = set2.head;

             while(curr != null)

             {

                    if(!isMember(curr.data))

                           return false;

                    curr = curr.next;

             }

            

             return true;

       }

       public IntegerSet intersection(IntegerSet set2)

       {

             IntegerSet result = new IntegerSet(0);

             Node node = set2.head;

             while(node != null)

             {

                    if(isMember(node.data))

                           result.add(node.data);

                    node = node.next;

             }

            

             return result;

       }

      

       public IntegerSet union(IntegerSet set2)

       {

             IntegerSet result = new IntegerSet(0);

             Node node = head;

             while(node != null)

             {

                    result.add(node.data);

                    node = node.next;

             }

            

             node = set2.head;

             while(node != null)

             {

                    result.add(node.data);

                    node = node.next;

             }

            

             return result;

       }

      

       public IntegerSet difference(IntegerSet set2)

       {

             IntegerSet result = new IntegerSet(0);

             Node node = head;

             while(node != null)

             {

                    if(!set2.isMember(node.data))

                           result.add(node.data);

                    node = node.next;

             }

            

             return result;

       }

      

       public void display()

       {

             Node curr = head;

             if(head == null)

                    System.out.println("Empty Set");

             else

             {

                    while(curr != null)

                    {

                           System.out.print(curr.data+" ");

                           curr = curr.next;

                    }

                    System.out.println();

             }

       }

      

}

//end of IntegerSet.java

//IntegerSetDemo.java

import java.util.Scanner;

public class IntegerSetDemo {

             

       public static void main(String[] args) {

      

             IntegerSet set1 = new IntegerSet(5);

             IntegerSet set2 = new IntegerSet(5);

             System.out.println("Set 1 : ");

             set1.display();

             System.out.println("Set 2 : ");

             set2.display();

             IntegerSet result;

             int choice, num;

             Scanner scan = new Scanner(System.in);

             do

             {

                    System.out.println("1. Set Empty");

                    System.out.println("2. Check Member");

                    System.out.println("3. Add an item");

                    System.out.println("4. Get the size");

                    System.out.println("5. Remove an element");

                    System.out.println("6. Check Subset");

                    System.out.println("7. Intersection of Set1 and Set2");

                    System.out.println("8. Union of Set1 and Set2");

                    System.out.println("9. Difference of Set1 and Set2");

                    System.out.println("10. Exit");

                    System.out.print("Enter your choice(1-9) : ");

                    choice = scan.nextInt();

                    switch(choice)

                    {

                    case 1:

                           System.out.println("Set 1 Empty : "+set1.isEmpty());

                           break;

                    case 2:

                           System.out.print("Enter an integer : ");

                           num = scan.nextInt();

                           System.out.println(num+" present in Set1 : "+set1.isMember(num));

                           break;

                    case 3:

                           System.out.print("Enter an integer : ");

                           num = scan.nextInt();

                           if(set1.add(num))

                                 System.out.println(num+" added in Set1");

                           else

                                 System.out.println(num+" already present in Set1");

                           set1.display();

                           break;

                    case 4:

                           System.out.println("Size of Set1 : "+set1.getSize());

                           break;

                    case 5:

                           System.out.print("Enter an integer : ");

                           num = scan.nextInt();

                           if(set1.remove(num))

                                 System.out.println(num+" removed in Set1");

                           else

                                 System.out.println(num+" not present in Set1");

                           set1.display();

                           break;

                    case 6:

                           if(set1.isSubset(set2))

                                 System.out.println("Set 1 is subset of Set2");

                           else

                                 System.out.println("Set 1 is not a subset of Set2");

                           break;

                    case 7:

                           result = set1.intersection(set2);

                           result.display();

                           break;

                    case 8:

                           result= set1.union(set2);

                           result.display();

                           break;

                    case 9:

                           result = set1.difference(set2);

                           result.display();

                           break;

                    case 10:

                           break;

                                

                    }

             }while(choice !=10);

             scan.close();

       }

}

//end of IntegerSetDemo.java