Question

Write a C++ program that takes two sets ’A’ and ’B’ as input read from the file prog1 input.txt. The first line of the file corresponds to the set ’A’ and the second line is the set ’B’. Every element of each set is a character, and the characters are separated by space. Implement algorithms for the following operations on the sets. Each of these algorithms must be in separate methods or subroutines. The output should be written in the file prog1 output.txt. Write a title before the output of each operation.

1. Union

2. Intersection

3. A - B

4. Decide if (A ⊂ B).

Program 2 – 50 points

Write a program that takes three sets ’A’, ’B’, ’C’ as input read from the file prog2 input.txt. The first line of the file corresponds to the set ’A’, the second line is the set ’B’, and the third line is the set ’C’. Every element of each set is a character, and the characters are separated by space. Implement algorithms for the following operations on the sets. Each of these algorithms must be in separate methods or subroutines. The output should be written in the file prog2 output.txt and the standard output. Write a title before the output of each operation.

1. (A∪B)∪C.

2. A∪(B∩C).

3. (A∪B)∩(A∪C). HINTS

•You may want to use arrays.

•Pay special attention to the parentheses because they indicate the order. For example: (A ∪ B) ∪ C means to compute (A ∪ B) first, and then ∪C.

•Consider reusing the algorithms for union and intersection that you have defined already. For example, to compute (A ∪ B) ∪ C:

First, compute A ∪ B using the function that computes the union that you already defined. Let’s say that you store that result in an array R.

Then, compute R ∪ C using the function that computes the union that you already defined.

Answer 1

Program

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

string unionOf(int a[], int b[]){
string s="Union of SET A and SET B is ";
for(int i=0; i<128; i++){
if(a[i]==1 || b[i]==1){
char c=i;
s+=c;
s+=" ";
}
}
return s;
}

string intersection(int a[], int b[]){
string s="intersection of SET A and SET B is ";
for(int i=0; i<128; i++){
if(a[i]==1 && b[i]==1){
char c=i;
s+=c;
s+=" ";
}
}
return s;
}

string difference(int a[], int b[]){
string s="Difference of SET A and SET B is ";
for(int i=0; i<128; i++){
if(a[i]-b[i]==1){
char c=i;
s+=c;
s+=" ";
}
}
return s;
}

string properSubset(int a[], int b[]){
string s;
int m=0;
int n=0;
for(int i=0; i<128; i++){
if(b[i]-a[i]==-1){
return "SET A is not a proper subset of SET B";
}
if(a[i]==1){
m++;
}
if(b[i]==1){
n++;
}
}
if(m==n){
return "SET A is not a proper subset of SET B";
}
return "SET A is a proper subset of SET B";
}

int main(){
int setA[128];
int setB[128];

for(int i=0; i<128; i++){
setA[i]=0;
setB[i]=0;
}

string str;
int j;

ifstream file("Read.txt");

getline(file, str);
cout<<str<<endl;
for(int i=9; i<str.length(); i++){
j=(int)str.at(i);
setA[j]=1;
}

getline(file,str);
cout<<str<<endl;
for(int i=0; i<str.length(); i++){
j=(int)str.at(i);
setB[j]=1;
}

ofstream myfile;
myfile.open ("output.txt");
string result=unionOf(setA,setB);
cout<<result<<endl;
myfile<<result<<endl;

result=intersection(setA,setB);
cout<<result<<endl;
myfile<<result<<endl;

result=difference(setA,setB);
cout<<result<<endl;
myfile<<result<<endl;

cout<<properSubset(setA,setB)<<endl;
myfile<<result<<endl;
myfile.close();

}

Output