An application is needed to keep track of shareholders at an annual corporate meeting. The application takes as input a file containing the shareholder names. When a shareholder arrives, his or her name is checked against the list for permission to enter the meeting. That name is then moved to a list of those present, which management can request to see at any time. If the person leaves the meeting, his or her name should be moved from the present list back to the shareholder list. We’ve described these data structures as lists, but it should be apparent that a set is also a natural way of representing the data, given that the only operations are to search the set and move names in and out. You can also use the Name class that we developed for this book, but the ComparedTo function should be replaced with overloaded relational operators.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.