//Integer.h #include #include "stdafx.h" using namespace std; class IntegerSet { public: IntegerSet(); void unionofsets(); void Intersectionofsets(); void Insert(); void deleteE(); void printset(); void IsEqualto(); void RandSet(); private: int a[100]; int j[100]; int unions[100]; int intersect[100]; }; //Integer.cpp #include "stdafx.h" #include #include #include using namespace System; using namespace std; #include "Integer.h" IntegerSet::IntegerSet() { for(int i = 0; i < 100; i++) { a[i] = 0; j[i] = 0; unions[i] = 0; intersect[i] = 0; } } void IntegerSet::RandSet() { srand((unsigned)time(0)); int random_integer; for(int n=0; n<100; n++) { random_integer = (rand()%2); a[n] = random_integer; } for(int n=0; n<100; n++) { random_integer = (rand()%2); j[n] = random_integer; } } void IntegerSet::unionofsets() { for(int r = 0; r < 100; r++) { if((a[r] == 1)||(j[r] == 1)) { unions[r] = 1; } if((a[r] == 0)&&(j[r] == 0)) { unions[r] = 0; } } } void IntegerSet::Intersectionofsets() { for(int r = 0; r <= 100; r++) { if((a[r] == 1)&&(j[r] == 1)) { intersect[r] = 1; } else { intersect[r] = 0; } } //cout < using namespace System; using namespace std; #include "Integer.h" int main(array ^args) { IntegerSet q; q.RandSet();//initializes arrays q.unionofsets();//Union of Sets q.Intersectionofsets();//Intersection of sets q.printset(); q.IsEqualto(); system("pause"); system("cls"); cout << "Insert Command" << endl; q.Insert(); q.printset(); q.IsEqualto(); system("pause"); system("cls"); q.deleteE(); q.printset(); q.IsEqualto(); system("pause"); system("cls"); Console::WriteLine(L"End Program"); Console::ReadKey(); return 0; }