Answered step by step
Verified Expert Solution
Question
1 Approved Answer
I have already posted this question last week and received an answer with a code that didn't work! I am using C++ on Visual Data
I have already posted this question last week and received an answer with a code that didn't work! I am using C++ on Visual Data Studio 2015 and need to follow all of the question's requirements. I have attached a picture of the question and what it asks for down below. Please include as many comments throughout the entire line of code and explain if there is anything to do for the code to produce the same output. This is due tomorrow so it would be amazing if you all answered it shortly. Will rate afterwards, thank you!
1. (120 pts) Write a C++ or Java class that stores a data set of strings consisting only of numbers ('O' -'9') and English letters (both lower and upper cases). Your class needs to implement the following dictionary functions. Make sure also that your program contains reasonable error checking. Two constructor methods/functions, o one that does not have any parameter and initializes the data set as empty set, and o one that takes a parameter consisting of a set of strings and initialize the data set with those strings. int search(string s) This function returns the number of copies of strings in the data set, or if the data set does not contain the string s. void add(string s) This function adds a copy of the string s to the data set. void remove(strings) This function removes a copy of the strings from the data set or does nothing if the data set does not contain the string s. void print() This function prints all strings in the data set (in no particular order). In case there are identical string in the data set all copies of the string contained in the data set will be printedStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started