rite a class that implements a 'Set' of integers. set is a collection of items in which no item occurs more than once. Internally, ou must represent the set using an array of size 100 and write any private netions suitable. However, the class should have the given 'public' functions. gnatures/Protocols of these functions are as follows: (you can use additional nctions and members variable if required) lass MySet { zivate: /array of size 100 ublic: ySet(); //constructor pid add (int element); // add an element (no epetition in sets) oid remove (int element); // remove an element nt count (); // returns present count of the elements ool isMember (int element); //returns if an element is resent pid print (); //prints all elements in ascending orde: pol check_equal() // A check equal () method which akes another set as argument and returns true if botl re equal. Remember two sets with same elements are qual regardless of the order of lements
rite a class that implements a 'Set' of integers. set is a collection of items in which no item occurs more than once. Internally, ou must represent the set using an array of size 100 and write any private netions suitable. However, the class should have the given 'public' functions. gnatures/Protocols of these functions are as follows: (you can use additional nctions and members variable if required) lass MySet { zivate: /array of size 100 ublic: ySet(); //constructor pid add (int element); // add an element (no epetition in sets) oid remove (int element); // remove an element nt count (); // returns present count of the elements ool isMember (int element); //returns if an element is resent pid print (); //prints all elements in ascending orde: pol check_equal() // A check equal () method which akes another set as argument and returns true if botl re equal. Remember two sets with same elements are qual regardless of the order of lements
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Make a simple c++ code
![Write a class that implements a 'Set' of integers.
A set is a collection of items in which no item occurs more than once. Internally,
you must represent the set using an array of size 100 and write any private
functions suitable. However, the class should have the given 'public' functions.
Signatures/Protocols of these functions are as follows: (you can use additional
functions and members variable if required)
class MySet {
private:
//array of size 100
public:
MySet (); //constructor
void add (int element); // add an element (no
repetition in sets)
void remove (int element); // remove an element
int count (); // returns present count of the elements
bool isMember (int element); //returns if an element is
present
void print (); //prints all elements in ascending order
bool check equal () // A check equal () method which
takes another set as argument and returns true if both
are equal. Remember two sets with same elements are
equal regardless of the order o£
elements
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F5de9b1a7-ce04-43f5-87d9-4de3e25f8076%2F751493f7-3eee-49bd-92ea-8b95b0f04fa3%2Fwgcikek_processed.png&w=3840&q=75)
Transcribed Image Text:Write a class that implements a 'Set' of integers.
A set is a collection of items in which no item occurs more than once. Internally,
you must represent the set using an array of size 100 and write any private
functions suitable. However, the class should have the given 'public' functions.
Signatures/Protocols of these functions are as follows: (you can use additional
functions and members variable if required)
class MySet {
private:
//array of size 100
public:
MySet (); //constructor
void add (int element); // add an element (no
repetition in sets)
void remove (int element); // remove an element
int count (); // returns present count of the elements
bool isMember (int element); //returns if an element is
present
void print (); //prints all elements in ascending order
bool check equal () // A check equal () method which
takes another set as argument and returns true if both
are equal. Remember two sets with same elements are
equal regardless of the order o£
elements
}
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY