Question

Please give an answer which works to print the answer given below. Please use the necessary header .h and .cpp files. Please give the right solution. "ITS MY HUMBLE REQUEST TO GIVE THE RIGHT SOLUTION"

Question 2 – Creating and working with other Containers

A Set is a data structure which contains information on whether a value belongs to

that set or not. In this question, you have to implement an integer Set which is able

to tell whether an integer is a member of that Set or not. For this question our set

can only contain the numbers 0..9. Because our list of possible members is small we

can represent the Set by a Boolean map where we have an array, called content,

with 10 elements. If the integer i is in the set then content[i] is true, otherwise it is

false. Thus if the set contains the number 3 then content[3] is true. If the set doesn’t

contain the number 8 then content[8] is false. In this question, our set starts out

empty - it contains no members.

Create a Set class in Set.cpp and Set.h implement the following functions:



Constructor – makes the set empty by setting all elements of content to false.



add(int val) – ensures that the set contains element val by setting the

corresponding element of content to true. If val is outside the range of 0..9

then add does nothing.



remove(int val) – ensures that the set does not contain the element val. If val

is outside the range 0..9 then val does nothing.



in(int val) returns true if val is in the set and false otherwise. If val is outside

the range 0..9 then in() returns false.

With the correct implementation of the class file above the q2main.cpp file

should print:

members

1 is member

3 is member

5 is member

7 is member

members

2 is member

4 is member

7 is member

8 is member

Answer 1

/*
C++ program that demonstrates the Set class methods
*/
//main.c
//include header files
#include<iostream>
//include Set.h header file
#include "Set.h"
using namespace std;
int main()
{

   //Create a Set class object
   Set set;
   //Add 1,3,5,7 to set
   set.add(1);
   set.add(3);
   set.add(5);
   set.add(7);

   cout<<"members"<<endl;
   //print only set elements
   for(int index=0;index<10;index++)
       if(set.in(index))
           cout<<index<<" is member"<<endl;

   //Create a Set class object
   Set set2;
   cout<<"members"<<endl;
   //Add2,4,7,8
   set2.add(2);
   set2.add(4);
   set2.add(7);
   set2.add(8);
   //print only set elements
   for(int index=0;index<10;index++)
       if(set2.in(index))
           cout<<index<<" is member"<<endl;

   //pause program output on console
   system("pause");
   return 0;
}

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

//Set.h
#ifndef SET_H
#define SET_H
//Class Set declaration
class Set
{
private:
   //an array of boolean type of size,10
   bool contents[10];
public:
   //constructor
   Set();
   //Methods
   void add(int val);
   void remove(int val);
   bool in(int val);
};
#endif SET_H

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

//Set.cpp

//Implementation file
#include<iostream>
#include "Set.h"
//Constructor to false to all contents array
Set::Set()
{
   int index=0;
   for(index=0;index<10;index++)
       contents[index]=false;
}
//add method to set val to the corresponding value in contents array
void Set::add(int val)
{
   if(val>=0 && val<10)
       contents[val]=true;
}
//remove method to set val false to the corresponding value in contents array
void Set::remove(int val)
{
   if(val>=0 && val<10)
       contents[val]=false;
}
//in method that returns true if the val is in the set otherwise return false
bool Set::in(int val)
{
   if(val>=0 && val<10)
   {
       if(contents[val])
           return true;
       else
           return false;
   }
}

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

Sample Output: