Question

Use C++ programing language

Please don't use other Chegg solved solutions, make it new thanks.

Assignment requirements

Pre-requisite: Please read zyBook Chapter 6 Sets and understand the three operations of Sets (union, intersection, and difference) .

You will be creating your custom Set (think a list of unique elements) class in C++ or a language of your choice. Please do NOT use STL, or any pre-defined library for this assignment.

1. The data type of the set collection: array (or vector).

2. Create three operations (based on Set ADT descriptions in zyBook Chapter 6):

-union()

-intersection()

-difference()

3. Put some test code in main()

6.2 Set operations Union, intersection, and difference The union of sets X and Y, denoted as XU Y, is a set that contains every element from X, every element from Y, and no additional elements. Ex: (54 19,75}{75, 12) = {12, 19,54,75). The intersection of sets X and Y, denoted as X n y, is a set that contains every element that is in both X and Y, and no additional elements. Ex(54, 19,75) n (75, 12) = (75) The difference of sets X and Y denoted as X\Y, is a set that contains every element that is in X but not in Y, and no additional elements. Ex {54, 19,75}\{75, 12) = {54, 19) The union and intersection operations are commutative, so XUY-YU X and XY.YOX. The difference operation is not commutative. PARTICIPATION ACTIVITY 6.2.1: Set union, intersection, and difference Start set1 = {93, 61, 82, 76) set2 (82, 23, 46, 93 ) Create new empty set Tor each lelonent in notli Adid element to result tot cachement is 23 Addolorent to remat Operation Result

Answer 1

Please look at my code and in case of indentation issues check the screenshots.

-------------main.cpp---------------

#include <iostream>
#include <vector>
using namespace std;

class Set{
   private:
       int numOfElements;           //set with vector to store elements and numOfElements to store size
       vector <int>setElements;

   public:
       Set()
       {
           numOfElements = 0;       //default constructor sets numOfElements to 0
       }

       void insert(int value)       //inserts a new value into set, only if the value is not already present
       {
           for(int i = 0; i < numOfElements; i++)
           {
               if(setElements[i] == value){   //if value already exists, just return
                   return;
               }
           }
           setElements.push_back(value);
           numOfElements++;
       }

       int setSize(){               //returns size of set
           return numOfElements;
       }

       int search(int value){       //searches if a value exists in set,
           for(int i = 0; i < numOfElements; i++){
               if(setElements[i] == value)       //if value exists, then return 1
                   return 1;
           }
           return 0;                           //if value does not exists, return 0
       }

       int getElementAtIndex(int i){           //returns element of set at a given index
           return setElements[i];
       }

       void printSet(){                       //prints the set
           cout << "{";
           int i;
           for(i = 0; i < numOfElements - 1; i++){
               cout << setElements[i] << ", ";
           }
           cout << setElements[i] << "}\n\n";
       }
};

Set SetUnion(Set set1, Set set2)   //returns Union of 2 sets
{
   Set result;
   for(int i = 0; i < set1.setSize(); i++){
       result.insert(set1.getElementAtIndex(i));
   }
   for(int i = 0; i < set2.setSize(); i++){
       result.insert(set2.getElementAtIndex(i));
   }
   return result;
}

Set SetIntersection(Set set1, Set set2)   //returns Intersection of 2 sets
{
   Set result;
   for(int i = 0; i < set1.setSize(); i++){
       if (set2.search(set1.getElementAtIndex(i)) != 0){
           result.insert(set1.getElementAtIndex(i));
       }
   }
   return result;
}

Set SetDifference(Set set1, Set set2)   //returns SetDifference of 2 sets
{
   Set result;
   for(int i = 0; i < set1.setSize(); i++){
       if (set2.search(set1.getElementAtIndex(i)) == 0){
           result.insert(set1.getElementAtIndex(i));
       }
   }
   return result;
}

int main()
{
   Set set1;           //create empty set1
   set1.insert(93);   //insert elements
   set1.insert(61);
   set1.insert(82);
   set1.insert(76);

   Set set2;           //create empty set2
   set2.insert(82);   //insert elements
   set2.insert(23);
   set2.insert(46);
   set2.insert(93);

   cout << "set 1 is : ";   //print sets
   set1.printSet();

   cout << "set 2 is : ";
   set2.printSet();

   Set unionSet = SetUnion(set1, set2);       //call set functions
   Set intSet = SetIntersection(set1, set2);
   Set diffSet1 = SetDifference(set1, set2);
   Set diffSet2 = SetDifference(set2, set1);

   cout << "Union of sets is is: ";           //print results
   unionSet.printSet();

   cout << "Intersection of sets is is: ";
   intSet.printSet();

   cout << "Difference of set1, set2 is: ";
   diffSet1.printSet();

   cout << "Difference of set2 set1 is: ";
   diffSet2.printSet();

   return 0;
}

--------------Screenshots--------------

File Edit Selection Find View Goto Tools Project Preferences Help www TUIS TE main.cpp X 1 #include <iostream> 2 #include <vector> 3 using namespace std; 4 5 class Set{ 6 private: 7 int numofElements; //set with vector to store elements and numofElements to store size 8 vector <int>setElements; 9 10 public: 11 Set() 12 { 13 numofElements = 0; //default constructor sets numofElements to o 14 } 15 16 void insert(int value) //inserts a new value into set, only if the value is not already present 17 { 18 for(int i = 0; i < numOfElements; i++) 19 { 20 if(setElements[i] == value) { //if value already exists, just return 21 return; 22 } 23 } 24 setElements.push_back(value); 25 numofElements++; 26 } 27 28 int setSize() { //returns size of set 29 return numofElements; 30 } 31 32 33 int search(int value) { // searches if a value exists in set, 34 for(int i = 0; i < numOfElements; i++){ 35 if(setElements[i] == value) //if value exists, then return i 36 return 1; 37 } 38 return 0; //if value does not exists, return o 39 } 40 41 int getElementAtIndex(int i) { //returns element of set at a given index 42 return setElements[i]; 43 } 44 45 void printset() { //prints the set 46 cout << "{"; 47 int i; 48 for(i = 0; i < numOfElements - 1; i++){ 49 cout << setElements[i] « ", "; Line 116, Column 64 Tab Size: 4 C++ C

File Edit Selection Find View Goto Tools Project Preferences Help www TUIS TE main.cpp х 43 } 44 45 void printSet() { //prints the set 46 cout << "{"; 47 int i; 48 for(i = 0; i < numofElements - 1; i++){ 49 cout << setElements[i] «", "; 50 } 51 cout << setElements[i] << "}\n\n"; 52 } 53 }; 54 55 56 Set SetUnion (Set seti, set set2) //returns Union of 2 sets 57 { 58 Set result; 59 for(int i = 0; i < setl.setSize(); i++){ 60 result.insert (setl.getElementAtIndex(i)); 61 } 62 for(int i = 0; i < set2.setSize(); i++) { 63 result.insert (set2.getElementAtIndex(i)); 64 } 65 return result; 66 } 67 68 Set SetIntersection (Set seti, Set set2) //returns Intersection of 2 sets 69 { 70 Set result; 71 for(int i = 0; i < setl.setSize(); i++){ 72 if (set2.search(seti.getElementAtIndex(i)) != 0){ 73 result.insert(seti.getElementAtIndex(i)); 74 } 75 } 76 return result; 77 } 78 79 80 Set SetDifference (Set seti, set set2) //returns SetDifference of 2 sets 81 { 82 Set result; 83 for(int i = 0; i < setl.setSize(); i++){ 84 if (set2.search(seti.getElementAtIndex(i)) == 0){ 85 result.insert(seti.getElementAtIndex(i)); 86 } 87 } 88 return result; 89 } 90 91 int main() Line 116, Column 64 Tab Size: 4 C++ C

File Edit Selection Find View Goto Tools Project Preferences Help main.cpp X Set result; for(int i = 0; i < seti.setSize(); i++){ if (set2. search (seti.getElementAtIndex(i)) == 0) { result.insert(seti.getElementAtIndex(i)); } return result; } www int main() { Set setl; seti.insert(93); seti.insert(61); seti.insert(82); seti.insert (76); //create empty seti //insert elements TUIS TE 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 Set set2; //create empty set2 set2.insert (82); //insert elements set2.insert(23); set2.insert(46); set2.insert(93); cout << "set 1 is : "; //print sets seti.printSet(); cout << "set 2 is : "; set2.printSet(); Set unionSet = SetUnion (seti, set2); Set intSet = SetIntersection (seti, set2); Set diffset1 = SetDifference (seti, set2); Set diffSet2 = SetDifference (set2, seti); //call set functions //print results cout << "Union of sets is is: "; unionSet.printSet(); cout << "Intersection of sets is is: "; intSet.printSet(); cout << "Difference of seti, set2 is: "; diffSetl.printSet(); cout << "Difference of set2 seti is: "; diffSet2.printSet(); return 0; } Line 116, Column 64 Tab Size: 4 C++ C

--------------------Output-----------------------

vc@vaio:-/vs/cpp/custom set a 3 - vc@vaio:-/vs/cpp/custom set$ g++ main.cpp vc@vaio:-/vs/cpp/custom set$ /a.out set 1 is : {93, 61, 82, 76} set 2 is : {82, 23, 46, 93} Union of sets is is: {93, 61, 82, 76, 23, 46} Intersection of sets is is: {93, 82} Difference of seti, set2 is: {61, 76} Difference of set2 seti is: {23, 46} vc@vaio:-/vs/cpp/custom sets | A O и - Sat Oct 10 08:25 100%

------------------------------------------------------------------------------------

Please give a thumbs up if you find this answer helpful.
If it doesn't help, please comment before giving a thumbs down.
Please Do comment if you need any clarification.
I will surely help you.

Thankyou