If the code doesn't load, you can check it out on
GitHub
Group A
Q4: To create ADT that implements the 'set' concept.
a. Add (new Element) - Place a value into the set
b. Remove (element) - Remove the value
c. Contains (element) - Return true if element is in collection
d. Size() - Return number of values in collection
e. Iterator() - Return an iterator used to loop over collection
f. Intersection of two sets
g. Union of two sets
h. Difference between two sets
i. Subset
Other Questions in Data Structures and Algorithms Laboratory