Elimination of Duplicate Names Program Plan: Include required header file. Include required “std” namespace. Define main function Declare variable for input file. Declare a variable “ns” in “set” template class of “string” type. Open the given input file. If the input file is fail, then the program terminates. Otherwise, performs “while” loop. This loop executes until the end of file. Declare a variable “name” in “string” type. Read the name from given input file. Then insert a name into “set” template class. If any duplicate name contains, then it remove that name. Close the file. Display statement. Declare a variable “np” in constant iterator of “set” template class. Display the names to generate the invitation list after removing duplicates names using “for” loop.

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 9PP

Program Plan Intro

Elimination of Duplicate Names

Program Plan:

Include required header file.

Include required “std” namespace.

Define main function

Declare variable for input file.

Declare a variable “ns” in “set” template class of “string” type.

Open the given input file.

If the input file is fail, then the program terminates.

Otherwise, performs “while” loop. This loop executes until the end of file.

Declare a variable “name” in “string” type.

Read the name from given input file.

Then insert a name into “set” template class. If any duplicate name contains, then it remove that name.

Close the file.

Display statement.

Declare a variable “np” in constant iterator of “set” template class.

Display the names to generate the invitation list after removing duplicates names using “for” loop.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Suppose that the MinGap method below is added to the Treap class on Blackboard. public int MinGap ( ) Returns the absolute difference between the two closest numbers in the treap. For example, if the numbers are {2, 5, 7, 11, 12, 15, 20} then MinGap would returns 1, the absolute difference between 11 and 12. Requirements 1. Describe in a separate Design Document what additional data is needed and how that data is used to support an time complexity of O(1) for the MinGap method. Show as well that the methods Add and Remove can efficiently maintain this data as items are added and removed. (6 marks) 2. Re-implement the methods Add and Remove of the Treap class to maintain the augmented data in expected O(log n) time. (6 marks) 3. Implement the MinGap method. (4 marks) 4. Test your new method thoroughly. Include your test cases and results in a Test Document. (4 marks)

Suppose that the two Rank methods below are added to the Skip List class on Blackboard. public int Rank (T item) Returns the rank of the given item. public T Rank(int i) Returns the item with the given rank i. Requirements 1. Describe in a separate Design Document what additional data is needed and how that data is used to support an expected time complexity of O(log n) for each of the Rank methods. Show as well that the methods Insert and Remove can efficiently maintain this data as items are inserted and removed. (7 marks) 2. Re-implement the methods Insert and Remove of the Skip List class to maintain the augmented data in expected O(log n) time. Using the Contains method, ensure that added items are distinct. (6 marks) 3. Implement the two Rank methods. (8 marks) 4. Test your new methods thoroughly. Include your test cases and results in a Test Document. (4 marks)