Question

Intro to java project

template with instructions below

* IntegerSet.java
*/

/**
*
* @author StudentName
*/
public class IntegerSet {
  
/**
* Creates a new instance of IntegerSet   
*/
// TODO: implement the constructor
  
/**
* Return a new IntegerSet containing the union of the two IntegerSet objects
* passed as arguments
*/
// TODO: implement the union method
  
/**
* Return a new IntegerSet containing the intersection of the two IntegerSet objects
* passed as arguments
*/
// TODO: implement the intersection method
  
/**
* Inserts an element into the IntegerSet by setting the corresponding
* value within the set array to true. Returns false if the value was out
* of range and true otherwise.
*/
// TODO: implement the insertElement method
  
/**
* Deletes an element from the IntegerSet by setting the corresponding
* value within the set array to false. Returns false if the value was out
* of range and true otherwise.
*/
// TODO: implement the deleteElement method
  
/**
* @Override the toString method in the Object class
* Displays the integers contained by the IntegerSet separated by spaces.
* An empty set should be displayed as:
* { --- }
* An integer set containing 5 and 10 should be displayed as:
* { 5 10 }
*/
// TODO: implement the toString method   
  
/**
* Returns true iff the current IntegerSet contains the same integers as
* the IntegerSet supplied as an argument
*/
   // TODO: implement the isEqualTo method   
}

Answer 1

IntegerSet.java

public class IntegerSet {
private static final int MAX_SIZE = 101;
private int[] set;
  
public IntegerSet()
{
this.set = new int[MAX_SIZE];
}
  
public IntegerSet(IntegerSet copy)
{
this.set = new int[MAX_SIZE];
for(int i = 0; i < set.length; i++)
this.set[i] = copy.set[i];
}
  
public IntegerSet union(IntegerSet other)
{
IntegerSet result = new IntegerSet(this);
for(int i = 0; i < set.length; i++)
{
if(other.isIntegerSet(i))
result.insert(i);
}
return result;
}
  
public IntegerSet intersection(IntegerSet other)
{
IntegerSet result = new IntegerSet(this);
for(int i = 0; i < set.length; i++)
{
if(!other.isIntegerSet(i))
result.delete(i);
}
return result;
}
  
public boolean insert(int num)
{
if(num >= 0 && num < set.length)
{
set[num] = 1;
return true;
}
return false;
}
  
public boolean delete(int num)
{
if(num >= 0 && num < set.length)
{
set[num] = 0;
return true;
}
return false;
}
  
public boolean isIntegerSet(int num)
{
return(set[num] == 1);
}
  
public boolean isEmpty()
{
for(int i = 0; i < set.length; i++)
{
if(isIntegerSet(i))
return false;
}
return true;
}
  
@Override
public String toString()
{
String out = "Set: [";
if(isEmpty())
out += "---";
for(int i = 0; i < set.length; i++)
{
if(isIntegerSet(i))
out += i + " ";
}
out = out.trim() + "]";
return out;
}
  
public boolean isEqualTo(IntegerSet other)
{
for(int i = 0; i < set.length; i++)
{
if (other.isIntegerSet(i) != isIntegerSet(i))
return false;
}
return true;
}
}

IntegerSetTest.java (Test class)

import java.util.Random;

public class IntegerSetTest {
  
public static void main(String[] args) {
IntegerSet set1 = new IntegerSet();
IntegerSet set2 = new IntegerSet();
  
// insert 10 random numbers between 10 and 99 to each of the 2 sets
Random rand = new Random();
for(int i = 0; i < 10; i++)
{
int pick = 10 + rand.nextInt(99 - 10);
while(pick < 10 || pick > 99)
pick = 10 + rand.nextInt(99 - 10);
set1.insert(pick);
}
  
for(int i = 0; i < 10; i++)
{
int pick = 10 + rand.nextInt(99 - 10);
while(pick < 10 || pick > 99)
pick = 10 + rand.nextInt(99 - 10);
set2.insert(pick);
}
  
System.out.println("SET 1 --> " + set1);
System.out.println("SET 2 --> " + set2);
  
IntegerSet union = set1.union(set2);
IntegerSet intersection = set1.intersection(set2);
  
System.out.println("SET 1 UNION SET 2 --> " + union);
System.out.println("SET 1 INTERSECTION SET 2 --> " + intersection);
}
}

*************************************************************** SCREENSHOT ************************************************************

run: SET 1 --> Set: [38 42 67 71 74 75 77 83 88] SET 2 --> Set: [14 22 31 56 58 67 76 77 88 93] SET 1 UNION SET 2 --> Set: [14 22 31 38 42 56 58 67 71 74 75 76 77 83 88 93] SET 1 INTERSECTION SET 2 --> Set: [67 77 88] BUILD SUCCESSFUL (total time: 0 seconds)