#include #include #include #include #include #include "CommonName.h" #include "Name.h" using namespace std; // function prototype(s) string toUpper(string name); int main() { // constant const int SIZE = 1000; fstream inputFile; Name nameList; // cout << names[0].getName(); string name; string ranking; int nextName = 0; string searchKey; inputFile.open("CommonFemaleNames.txt", ios::in); if (!inputFile) cout << "cannot access file"; else cout << "file opened\n"; if (inputFile) { inputFile >> ranking; int ranking_num = stoi(ranking); inputFile >> name; CommonName* newName = new CommonName(ranking_num, name); nameList.addName(newName); cout << newName->getName() << " "; cout << newName->getOrdinal() << endl; while (inputFile >> ranking) { ranking_num = stoi(ranking); inputFile >> name; CommonName* newName = new CommonName(ranking_num, name); nameList.addName(newName); cout << newName->getName() << " "; cout << newName->getOrdinal() << endl; } } inputFile.close(); nameList.sortNames(); cout << "Enter a female name, enter STOP to end: "; cin >> searchKey; searchKey = toUpper(searchKey); auto start_time = chrono::high_resolution_clock::now(); int ord = nameList.findBinary(searchKey, 0, nextName); auto end_time = chrono::high_resolution_clock::now(); cout << "Binary search took "; cout << "Popular " << ord << endl; cout << chrono::duration_cast(end_time - start_time).count(); cout << " microseconds" << endl; start_time = chrono::high_resolution_clock::now(); ord = nameList.findLinear(searchKey); end_time = chrono::high_resolution_clock::now(); cout << "Linear search took "; cout << "Popular " << ord << endl; cout << chrono::duration_cast(end_time - start_time).count(); cout << " microseconds" << endl; return 0; } // definitions string toUpper(string name) { for (int i = 0; i < name.size(); i++) { name[i] = toupper(name[i]); } return name; } #ifndef CommonName_H #define CommonName_H #include #include using namespace std; class CommonName { private: int ordinal; string name; public: //Constructor CommonName (int ordinal, string name); // accessors int getOrdinal() const; string getName() const; }; #endif #include "CommonName.h" #include using namespace std; CommonName::CommonName (int ordinal , string name) { this -> ordinal = ordinal; this -> name = name; } int CommonName::getOrdinal() const { return ordinal; } string CommonName::getName() const { return name; } #ifndef Name_H #define Name_H #include #include #include "CommonName.h" class Name { private: CommonName* namePair; int nextName; // void findRecursive(string name, int low, int high); public: Name(); void addName(CommonName pair); void sortNames(); int findLinear(string name); int findBinary(string name, int low, int high); }; #endif #include "Name.h" #include "CommonName.h" #include #include using namespace std; Name::Name() { CommonName namePair = CommonName[1000]; // dynamic allocation of an array of 1000 objects int nextName; // default value, it will increase as we instantiate a new namePair object } void Name::addName(CommonName pair) { if (nextName < 1000) { namePair[nextName] = pair; nextName++; } } void Name::sortNames() { /// sorting the array CommonName* temp; for (int i = 0; i < 1000; i++) { for (int j = i + 1; j < 1000; j++) { if (namePair[i]->getName().compare(namePair[j]->getName()) > 0) { temp = namePair[i]; namePair[i] = namePair[j]; namePair[j] = temp; } } } } int Name::findLinear(string searchKey) { int position = -1; try { for (int i = 0; i < 1000; ++i) { if (namePair[i]->getName().compare(searchKey) == 0) { position = i; return namePair[i]->getOrdinal(); /// getsvalue, popularity, how common the name is } } if (position == -1) // nothing found position is still -1 throw searchKey; } catch (string searchKey) { cout << searchKey << " is not on the list" << endl; } } int Name::findBinary(string searchKey, int first, int last) { int middle; int position = -1; if (first > last) return position; middle = (first + last) / 2; if ((namePair[middle]->getName().compare(searchKey)) == 0) return namePair[middle]->getOrdinal(); if ((namePair[middle]->getName().compare(searchKey)) < 0) { return Name::findBinary(searchKey, middle + 1, last); } else return Name::findBinary(searchKey, first, middle - 1); }

#include #include #include #include #include #include "CommonName.h" #include "Name.h" using namespace std; // function prototype(s) string toUpper(string name); int main() { // constant const int SIZE = 1000; fstream inputFile; Name nameList; // cout << names[0].getName(); string name; string ranking; int nextName = 0; string searchKey; inputFile.open("CommonFemaleNames.txt", ios::in); if (!inputFile) cout << "cannot access file"; else cout << "file opened\n"; if (inputFile) { inputFile >> ranking; int ranking_num = stoi(ranking); inputFile >> name; CommonName* newName = new CommonName(ranking_num, name); nameList.addName(newName); cout << newName->getName() << " "; cout << newName->getOrdinal() << endl; while (inputFile >> ranking) { ranking_num = stoi(ranking); inputFile >> name; CommonName* newName = new CommonName(ranking_num, name); nameList.addName(newName); cout << newName->getName() << " "; cout << newName->getOrdinal() << endl; } } inputFile.close(); nameList.sortNames(); cout << "Enter a female name, enter STOP to end: "; cin >> searchKey; searchKey = toUpper(searchKey); auto start_time = chrono::high_resolution_clock::now(); int ord = nameList.findBinary(searchKey, 0, nextName); auto end_time = chrono::high_resolution_clock::now(); cout << "Binary search took "; cout << "Popular " << ord << endl; cout << chrono::duration_cast(end_time - start_time).count(); cout << " microseconds" << endl; start_time = chrono::high_resolution_clock::now(); ord = nameList.findLinear(searchKey); end_time = chrono::high_resolution_clock::now(); cout << "Linear search took "; cout << "Popular " << ord << endl; cout << chrono::duration_cast(end_time - start_time).count(); cout << " microseconds" << endl; return 0; } // definitions string toUpper(string name) { for (int i = 0; i < name.size(); i++) { name[i] = toupper(name[i]); } return name; } #ifndef CommonName_H #define CommonName_H #include #include using namespace std; class CommonName { private: int ordinal; string name; public: //Constructor CommonName (int ordinal, string name); // accessors int getOrdinal() const; string getName() const; }; #endif #include "CommonName.h" #include using namespace std; CommonName::CommonName (int ordinal , string name) { this -> ordinal = ordinal; this -> name = name; } int CommonName::getOrdinal() const { return ordinal; } string CommonName::getName() const { return name; } #ifndef Name_H #define Name_H #include #include #include "CommonName.h" class Name { private: CommonName* namePair; int nextName; // void findRecursive(string name, int low, int high); public: Name(); void addName(CommonName pair); void sortNames(); int findLinear(string name); int findBinary(string name, int low, int high); }; #endif #include "Name.h" #include "CommonName.h" #include #include using namespace std; Name::Name() { CommonName namePair = CommonName[1000]; // dynamic allocation of an array of 1000 objects int nextName; // default value, it will increase as we instantiate a new namePair object } void Name::addName(CommonName pair) { if (nextName < 1000) { namePair[nextName] = pair; nextName++; } } void Name::sortNames() { /// sorting the array CommonName* temp; for (int i = 0; i < 1000; i++) { for (int j = i + 1; j < 1000; j++) { if (namePair[i]->getName().compare(namePair[j]->getName()) > 0) { temp = namePair[i]; namePair[i] = namePair[j]; namePair[j] = temp; } } } } int Name::findLinear(string searchKey) { int position = -1; try { for (int i = 0; i < 1000; ++i) { if (namePair[i]->getName().compare(searchKey) == 0) { position = i; return namePair[i]->getOrdinal(); /// getsvalue, popularity, how common the name is } } if (position == -1) // nothing found position is still -1 throw searchKey; } catch (string searchKey) { cout << searchKey << " is not on the list" << endl; } } int Name::findBinary(string searchKey, int first, int last) { int middle; int position = -1; if (first > last) return position; middle = (first + last) / 2; if ((namePair[middle]->getName().compare(searchKey)) == 0) return namePair[middle]->getOrdinal(); if ((namePair[middle]->getName().compare(searchKey)) < 0) { return Name::findBinary(searchKey, middle + 1, last); } else return Name::findBinary(searchKey, first, middle - 1); }

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

#include <iostream>
#include <fstream>
#include <cctype>
#include <string>
#include <chrono>
#include "CommonName.h"
#include "Name.h"

using namespace std;

// function prototype(s)
string toUpper(string name);

int main() {
// constant
const int SIZE = 1000;
fstream inputFile;

Name nameList;
// cout << names[0].getName();
string name;
string ranking;
int nextName = 0;
string searchKey;

inputFile.open("CommonFemaleNames.txt", ios::in);
if (!inputFile)
cout << "cannot access file";
else
cout << "file opened\n";

if (inputFile) {

inputFile >> ranking;
int ranking_num = stoi(ranking);
inputFile >> name;

CommonName* newName = new CommonName(ranking_num, name);

nameList.addName(newName);

cout << newName->getName() << " ";
cout << newName->getOrdinal() << endl;
while (inputFile >> ranking) {

ranking_num = stoi(ranking);
inputFile >> name;
CommonName* newName = new CommonName(ranking_num, name);
nameList.addName(newName);
cout << newName->getName() << " ";
cout << newName->getOrdinal() << endl;

}

}
inputFile.close();

nameList.sortNames();

cout << "Enter a female name, enter STOP to end: ";
cin >> searchKey;
searchKey = toUpper(searchKey);

auto start_time = chrono::high_resolution_clock::now();
int ord = nameList.findBinary(searchKey, 0, nextName);
auto end_time = chrono::high_resolution_clock::now();
cout << "Binary search took ";
cout << "Popular " << ord << endl;
cout << chrono::duration_cast<chrono::microseconds>(end_time - start_time).count();
cout << " microseconds" << endl;

start_time = chrono::high_resolution_clock::now();
ord = nameList.findLinear(searchKey);
end_time = chrono::high_resolution_clock::now();
cout << "Linear search took ";
cout << "Popular " << ord << endl;
cout << chrono::duration_cast<chrono::microseconds>(end_time - start_time).count();
cout << " microseconds" << endl;

return 0;
}

// definitions
string toUpper(string name) {
for (int i = 0; i < name.size(); i++) {
name[i] = toupper(name[i]);
}
return name;
}

#ifndef CommonName_H
#define CommonName_H
#include <string>
#include <iostream>

using namespace std;

class CommonName {
private:
int ordinal;
string name;

public:
//Constructor
CommonName (int ordinal, string name);
// accessors
int getOrdinal() const;
string getName() const;
};

#endif

#include "CommonName.h"

#include <string>
using namespace std;

CommonName::CommonName (int ordinal , string name) {
this -> ordinal = ordinal;
this -> name = name;
}

int CommonName::getOrdinal() const {
return ordinal;
}

string CommonName::getName() const {
return name;
}

#ifndef Name_H
#define Name_H
#include <string>
#include <iostream>
#include "CommonName.h"

class Name {
private:
CommonName* namePair;
int nextName;
// void findRecursive(string name, int low, int high);
public:
Name();

void addName(CommonName pair);
void sortNames();
int findLinear(string name);
int findBinary(string name, int low, int high);
};

#endif

#include "Name.h"
#include "CommonName.h"
#include <iostream>
#include <string>

using namespace std;

Name::Name() {
CommonName namePair = CommonName[1000]; // dynamic allocation of an array of 1000 objects
int nextName; // default value, it will increase as we instantiate a new namePair object
}

void Name::addName(CommonName pair) {
if (nextName < 1000) {
namePair[nextName] = pair;
nextName++;
}
}

void Name::sortNames() { /// sorting the array
CommonName* temp;
for (int i = 0; i < 1000; i++) {
for (int j = i + 1; j < 1000; j++) {
if (namePair[i]->getName().compare(namePair[j]->getName()) > 0)
{
temp = namePair[i];
namePair[i] = namePair[j];
namePair[j] = temp;

}
}
}
}

int Name::findLinear(string searchKey) {

int position = -1;

try {
for (int i = 0; i < 1000; ++i) {
if (namePair[i]->getName().compare(searchKey) == 0) {
position = i;
return namePair[i]->getOrdinal(); /// getsvalue, popularity, how common the name is
}
} if (position == -1) // nothing found position is still -1
throw searchKey;
}
catch (string searchKey) {

cout << searchKey << " is not on the list" << endl;
}

}

int Name::findBinary(string searchKey, int first, int last) { int middle;
int position = -1; if (first > last)
return position;

middle = (first + last) / 2;
if ((namePair[middle]->getName().compare(searchKey)) == 0)
return namePair[middle]->getOrdinal();
if ((namePair[middle]->getName().compare(searchKey)) < 0) {

return Name::findBinary(searchKey, middle + 1, last);
}
else
return Name::findBinary(searchKey, first, middle - 1);

}

**Name Sorting and Searching**

The attached file, CommonFemaleNames.txt, contains the top 1000 female names in the United States. The format is *integer string* where the *integer* is the popularity number (1 is most popular) and *string* is a female first name. The program is to read the list of names and create an array of objects. It then sorts the array in alphabetical order. The user enters a name, which the program searches for and then reports how common that name is. The program is to use two different search algorithms, a linear search and a binary search. It reports on how many microseconds it takes to find the name using each method.

**Requirements**

1. Each name and popularity number must be stored in a separate object.
2. The names on the list are all uppercase, but the program must find the name even if it is entered in lower case. Do this by converting the entered name to all caps.
3. It must give an appropriate message if the name entered is not on the list.
4. Both a linear and a binary search are required, for each name entered and the time it takes for each one reported.
5. Either the sort or the binary search must use a recursive method (Hint: a recursive binary search is easier than a recursive sort).

**Suggestions**

1. Chapters 8 and 19 have example C++ code for sorting and searching arrays.
2. Here is an example of getting the current time in microseconds. It requires
```cpp
#include <chrono>

auto start_time = chrono::high_resolution_clock::now(); ord = namelist.findBinary(name); auto end_time = chrono::high_resolution_clock::now(); cout << "Binary search took " << chrono::duration_cast<chrono::microseconds>(end_time - start_time).count() << " microseconds" << endl;
```
3. Note that on some systems the clock resolution is not fine enough and you may get 0 for the time. That is OK.

The image contains a UML diagram and a section of program information with sample output instructions.

### UML Diagram

The UML diagram consists of two classes: `Name` and `CommonName`.

#### `Name` Class
- **Attributes:**
- `namePair: CommonName[]`
- `nextName: int`

- **Methods:**
- `+ Name()`
- `+ addName(pair: CommonName): void`
- `+ sortNames(): void`
- `+ findLinear(name: string): int`
- `+ findBinary(name: string): int`
- `+ findRecursive(name: string, low: int, high: int): void`

*Note: It works best if `namePair` is an array of pointers to `CommonName` (My UML creator won't let me show that).*

#### `CommonName` Class
- **Attributes:**
- `- ordinal: int`
- `- names: string`

- **Methods:**
- `+ CommonName(ord: int, nName: string)`
- `+ getOrd(n: int): int`
- `+ getName(): string`

### Program Information

#### Extra Credit
- Use quicksort to sort the name objects (5 points).
- Throw an exception when a name is not found. Handle it in the calling procedure (5 points).

#### Upload
- Your source files (.h and .cpp) for this program as usual.

#### Sample Output
The program outputs the following text in a command prompt environment:

```
C:\Windows\system32\cmd.exe

The names have been read
The names have been sorted
Linear search: type a name; STOP to end: Pauline
Linear search took 3626 microseconds
PAULINE is the number 139 most popular female name
Enter a female name, enter STOP to end: Kathy
KATHY is the number 32 most popular female name
Enter a female name, enter STOP to end: Jennifer
JENNIFER is the number 1 most popular female name
Enter a female name, enter STOP to end: Mary
MARY is the number 8 most popular female name
Enter a female name, enter STOP to end: stop
```

This text demonstrates the program's functionality, including reading, sorting, and searching female names by popularity rank using linear search.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 5 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.