Use boolean array to perform set operations

Question

I am currently taking a computer science class that uses Java as the language of choice. I have no prior experience with Java. We have a homework assignment in which we are supposed to use a boolean array to implement set operations. We have to create a method that inserts an integer into the array, another that deletes an integer element, and several others. I am confused as how to do this with integers, as it is a boolean array. The datr for this class is:
private boolean base[];The constructor is:
public largeset(int size){ }We then have to create a method that inserts an integer into the array:
public void insert(int i){ }And one that deletes the element:
public void delete(int i) { }I am unsure how to do this using a boolean array. If it were an integer array I would not have any trouble, but I get an error when trying to insert/delete an integer from the boolean array. Can anyone help point me in the right direction? I would prefer advice only, not the actual code, as this is a homework assignment, and I would like to create the code myself so I actually know what I am doing. Thanks.

Answer 1

This is the assignment exactly as posted on the course website:
In this homework, we will use a boolean array to implement various set operations. Please create a class called largeset that supports set operations of any number of elements. The data of this class is
private boolean[] base;The constructor of the class is
public largeset(int size);  // create a boolean array of size "size" and store it in "base"The methods of the class are:
public void insert(int i);  // insert number i into the current set, where 0 <= i < base.length
public void delete(int i);  // delete number i from the current set, where 0 <= i < base.length
public boolean member(int i); // test if i is in the set
public largeset union(largeset B); // return the union of two sets
public largeset interset(largeset B); // return the intersection of two sets
public largeset subtract(largeset B); // return the subtraction of two sets
public largeset complement(); // return the complement of the current set
public boolean subset(largeset B); // test if the current set is a subset of set B
public int cardinality();  // return the number of elements in the current set
public String toString();  // return a string which is a printing of the current setThen create another class called testset that uses the largeset class. At first, please create the following two sets:
X = { 1, 3, 5, 7, ..., 999 };
Y = { 9, 18, 27, 36, ..., 999 };
Please perform the following tests:
1. display the cardinalities of X and Y, respectively.
2. display the content of substraction of Y by X.
3. display the square root of the sum of all the elements of X (Math.sqrt(x) will return the square root of x in double type).
4. For every pair of distinct elements x and y in Y, compute the sum of (Math.max(x, y) - Math.min(x, y)) (or equivalently, Math.abs(x - y)), and report this sum.