Does anyone have rest of the solution for Chapter 3, PE9 for book Data Structure
ID: 3815762 • Letter: D
Question
Does anyone have rest of the solution for Chapter 3, PE9 for book Data Structures Using C++ edition 2?
Some of the answer is there, but it seems two classes are missing (personType and ArrayListType) and also the Main function that invokes the program.
Using classes,design an online address book to keep track of the names,addresses,phone number and birthdays of family memebers,close friends and certain bussiness associates.your program should be able to handle a maximum of 500 entries.
a. Define the class, addressType that can store a street address, city, state and zip code. Use the appropriate functions to print and store the address. Also, use constructors to automatically initialize the data members.
b. Define the class extPersonType using the class personType, the class dateType, and the class addressType. Add a data member to this class to classify the person as a family member, friend, or business associate. Also, add a data member to store the phone number. Add (or override) methods to print and store the appropriate information. Use constructors to automatically initialize the data members.
c. Define the class addressBookType from the class arrayListType, as defined in this chapter. so that an object of type addressBookType can store objects of type extPersonType. An object of type addressBookType should be able to process a maximum of 500 entries. The program should perform:
________________________________________________________________________
i. Load the data into the address book from a disk.
ii. Search the address book by last name
iii. Print the address, phone number, and date of birth (if available) of a given person
iv. Print the names of people whose birthdays are in a given month or between two given dates
v. Print the names of all the people between two last names.
vi. Print the names of all the people having the same status, such as family, friends, or business.
class personType
{
public:
void print() const;
void setName(string first, string last);
string getFirstName() const;
string getLastName() const;
personType();
personType(string first, string last);
private:
};
void personType::print() const
{
cout << firstName << " " << lastName;
}
void personType::setName(string first, string last)
{
firstName = first;
lastName = last;
}
string personType::getFirstName() const
{
return firstName;
}
string personType::getLastName() const
{
return lastName;
}
personType::personType()
{
firstName = "";
lastName = "";
}
personType::personType(string first, string last)
{
firstName = first;
lastName = last;
}
class dateType
{
int month;
int day;
int year;
public:
dateType(int, int, int);
void print();
void setCompleteDate(int, int, int);
int fetchDay();
int fetchMonth();
int fetchYear();
~dateType();
};
dateType::dateType(int a, int b, int c)
{
month = a;
day = b;
year = c;
}
void dateType::print()
{
cout << "The date is: ";
cout << day << "/" << month << "/" << year << endl;
}
void dateType::setCompleteDate(int a, int b, int c)
{
if (a >= 1 && a <= 12)
month = a;
if (b >= 1 && b <= 7)
day = b;
if (c >= 1900 && c <= 2013)
year = c;
}
int dateType::fetchDay()
{
return day;
}
int dateType::fetchMonth()
{
return month;
}
int dateType::fetchYear()
{
return year;
}
dateType::~dateType()
{
}
class addressBookType : public arrayListType, public extPersonType
{
private:
arrayListType *arrList;
public:
addressBookType(void);
void addressBookType::add_newPerson(extPersonType p);
void add_newPerson(string first, string last, int month, int day, int year, string streetAdr, string city, string state, int pin, string status, int ph);
void search_lastName(string);
void display_details(string first, string last);
void fetchNames_birthdayMonth(int);
void fetchNames_birthdayDates(int, int);
void fetchNames_sameStatus(string);
void fetchNames_betweenLast(string, string);
void print();
~addressBookType();
};
addressBookType::addressBookType()
{
arrayListType(500);
}
void addressBookType::add_newPerson(string first, string last, int month, int day, int year, string streetAdr, string city, string state, int pin, string status, int ph)
{
extPersonType p(first, last, month, day, year, streetAdr, city, state, pin, status, ph);
insert(p);
}
void addressBookType::add_newPerson(extPersonType p)
{
insert p;
}
void addressBookType::search_lastName(string last)
{
for (int i = 0; i < length; i++)
{
if (list[i].getLastName().compare(last) == 0)
{
cout << "The person details are: ";
list[i].print;
return;
}
}
cout << "Sorry! The person is not found." << endl;
}
void addressBookType::display_details(string first, string last)
{
for (int i = 0; i < length; i++)
{
if ((list[i].getFirstName().compare(first) == 0)&& (list[i].getLastName().compare(last) == 0))
{
cout << "The person details are: ";
list[i].print;
}
}
}
void addressBookType::fetchNames_birthdayMonth(int month)
{
for (int i = 0; i < length; i++)
{
if (list[i].fetchMonth() == month)
cout << list[i].getFirstName() << "" << list[i].getLastName() << endl;
}
}
void addressBookType::fetchNames_birthdayDates(int date1, int date2)
{
for (int i = 0; i < length; i++)
{
if ((list[i].fetchDay() <= date1) && (list[i].fetchDay() >= date2))
{
cout << list[i].getFirstName() << "" << list[i].getLastName() << endl;
}
}
}
void addressBookType::fetchNames_sameStatus(string status)
{
for (int i = 0; i < length; i++)
{
if (list[i].getPersonStatus().compare(status) == 0)
{
cout << list[i].getFirstName() << "" << list[i].getLastName() << endl;
}
}
}
void addressBookType::fetchNames_betweenLast(string last1, string last2)
{
for (int i = 0; i < length; i++)
{
if ((list[i].getLastName().compare(last1) > 0) && (list[i].getLastName().compare(last2) < 0))
{
cout << list[i].getFirstName() << "" << list[i].getLastName() << endl;
}
}
}
void addressBookType::print()
{
cout << "The details of the address book: " << endl;
for (int i = 0; i < length; i++)
{
list[i].print();
cout << endl;
}
}
public:
extPersonType();
extPersonType(string first, string last, int month, int day, int year, string streetAdr, string city, string state, int pin, string status, int phone);
void setPersonType(string first, string last, int month, int day, int year, string streetAdr, string city, string state, int pin, string status, int phone);
string extPersonType::getPersonStatus() const;
int extPersonType::getPhoneNumber() const;
void print();
friend bool operator==(const extPersonType& extPerson, const extPersonType& otherPerson)
{
if (extPersonType& otherPerson() == otherPerson.getPhoneNumber())
return true;
else
return false;
}
~extPersonType();
};
extPersonType::extPersonType(): personType("",""),
dateType(0,0,0), addressType("","","",0)
{
personStatus = "";
phoneNumber = 0000000000;
}
extPersonType::extPersonType(string first, string last, int month, int day, int year, string streetAdr, string city, string state, int pin, string status, int phone)
: personType(first, last), dateType(month, day, year), addressType(streetAdr, city, state, pin)
{
personStatus = status;
phoneNumber = phone;
}
void extPersonType::setPersonType(string first, string last, int month, int day, int year, string streetAdr, string city, string state, int pin, string status, int phone)
{
personType::personType(first, last);
dateType::dateType(month, day, year);
addressType::addressType(streetAdr, city, state, pin);
personStatus = status;
phoneNumber = phone;
}
string extPersonType::getPersonStatus() const
{
return personStatus;
}
int extPersonType::getPhoneNumber() const
{
return phoneNumber;
}
void extPersonType::print()
{
cout << "Person information: " << endl;
personType::print();
addressType::print();
cout << "Phone Number: " << phoneNumber << endl;
dateType::print();
cout << "Person Status: " << personStatus << endl;
}
extPersonType::~extPersonType()
{
}
The class arrayListType from book
#pragma once
#ifndef arrayListType_H
#define arrayListType_H
//***********************************************************
// Author: D.S. Malik
//
// This class specifies the members to implement the basic
// properties of array-based lists.
//***********************************************************
#include <iostream>
#include <cassert>
using namespace std;
template <class elemType>
class arrayListType
{
public:
const arrayListType<elemType>& operator=
(const arrayListType<elemType>&);
//Overloads the assignment operator
bool isEmpty() const;
//Function to determine whether the list is empty
//Postcondition: Returns true if the list is empty;
// otherwise, returns false.
bool isFull() const;
//Function to determine whether the list is full.
//Postcondition: Returns true if the list is full;
// otherwise, returns false.
int listSize() const;
//Function to determine the number of elements in the list
//Postcondition: Returns the value of length.
int maxListSize() const;
//Function to determine the size of the list.
//Postcondition: Returns the value of maxSize.
void print() const;
//Function to output the elements of the list
//Postcondition: Elements of the list are output on the
// standard output device.
bool isItemAtEqual(int location, const elemType& item) const;
//Function to determine whether the item is the same
//as the item in the list at the position specified by
//Postcondition: Returns true if the list[location]
// is the same as the item; otherwise,
// returns false.
void insertAt(int location, const elemType& insertItem);
//Function to insert an item in the list at the
//position specified by location. The item to be inserted
//is passed as a parameter to the function.
//Postcondition: Starting at location, the elements of the
// list are shifted down, list[location] = insertItem;,
// and length++;. If the list is full or location is
// out of range, an appropriate message is displayed.
void insertEnd(const elemType& insertItem);
//Function to insert an item at the end of the list.
//The parameter insertItem specifies the item to be inserted.
//Postcondition: list[length] = insertItem; and length++;
// If the list is full, an appropriate message is
// displayed.
void removeAt(int location);
//Function to remove the item from the list at the
//position specified by location
//Postcondition: The list element at list[location] is removed
// and length is decremented by 1. If location is out of
// range,an appropriate message is displayed.
void retrieveAt(int location, elemType& retItem) const;
//Function to retrieve the element from the list at the
//position specified by location.
//Postcondition: retItem = list[location]
// If location is out of range, an appropriate message is
// displayed.
void replaceAt(int location, const elemType& repItem);
//Function to replace the elements in the list at the
//position specified by location. The item to be replaced
//is specified by the parameter repItem.
//Postcondition: list[location] = repItem
// If location is out of range, an appropriate message is
// displayed.
void clearList();
//Function to remove all the elements from the list.
//After this operation, the size of the list is zero.
//Postcondition: length = 0;
int seqSearch(const elemType& item) const;
//Function to search the list for a given item.
//Postcondition: If the item is found, returns the location
// in the array where the item is found; otherwise,
// returns -1.
void insert(const elemType& insertItem);
//Function to insert the item specified by the parameter
//insertItem at the end of the list. However, first the
//list is searched to see whether the item to be inserted
//is already in the list.
//Postcondition: list[length] = insertItem and length++
// If the item is already in the list or the list
// is full, an appropriate message is displayed.
void remove(const elemType& removeItem);
//Function to remove an item from the list. The parameter
//removeItem specifies the item to be removed.
//Postcondition: If removeItem is found in the list,
// it is removed from the list and length is
// decremented by one.
arrayListType(int size = 100);
//constructor
//Creates an array of the size specified by the
//parameter size. The default array size is 100.
//Postcondition: The list points to the array, length = 0,
// and maxSize = size
arrayListType(const arrayListType<elemType>& otherList);
//copy constructor
~arrayListType();
//destructor
//Deallocates the memory occupied by the array.
protected:
elemType *list; //array to hold the list elements
int length; //to store the length of the list
int maxSize; //to store the maximum size of the list
};
template <class elemType>
bool arrayListType<elemType>::isEmpty() const
{
return (length == 0);
}
template <class elemType>
bool arrayListType<elemType>::isFull() const
{
return (length == maxSize);
}
template <class elemType>
int arrayListType<elemType>::listSize() const
{
return length;
}
template <class elemType>
int arrayListType<elemType>::maxListSize() const
{
return maxSize;
}
template <class elemType>
void arrayListType<elemType>::print() const
{
for (int i = 0; i < length; i++)
cout << list[i] << " ";
cout << endl;
}
template <class elemType>
bool arrayListType<elemType>::isItemAtEqual
(int location, const elemType& item) const
{
return (list[location] == item);
}
template <class elemType>
void arrayListType<elemType>::insertAt
(int location, const elemType& insertItem)
{
if (location < 0 || location >= maxSize)
cerr << "The position of the item to be inserted "
<< "is out of range" << endl;
else
if (length >= maxSize) //list is full
cerr << "Cannot insert in a full list" << endl;
else
{
for (int i = length; i > location; i--)
list[i] = list[i - 1]; //move the elements down
list[location] = insertItem; //insert the item at the
//specified position
length++; //increment the length
}
} //end insertAt
template <class elemType>
void arrayListType<elemType>::insertEnd(const elemType& insertItem)
{
if (length >= maxSize) //the list is full
cerr << "Cannot insert in a full list" << endl;
else
{
list[length] = insertItem; //insert the item at the end
length++; //increment the length
}
} //end insertEnd
template <class elemType>
void arrayListType<elemType>::removeAt(int location)
{
if (location < 0 || location >= length)
cerr << "The location of the item to be removed "
<< "is out of range" << endl;
else
{
for (int i = location; i < length - 1; i++)
list[i] = list[i + 1];
length--;
}
} //end removeAt
template <class elemType>
void arrayListType<elemType>::retrieveAt
(int location, elemType& retItem) const
{
if (location < 0 || location >= length)
cerr << "The location of the item to be retrieved is "
<< "out of range." << endl;
else
retItem = list[location];
} //end retrieveAt
template <class elemType>
void arrayListType<elemType>::replaceAt
(int location, const elemType& repItem)
{
if (location < 0 || location >= length)
cerr << "The location of the item to be replaced is "
<< "out of range." << endl;
else
list[location] = repItem;
} //end replaceAt
template <class elemType>
void arrayListType<elemType>::clearList()
{
length = 0;
} //end clearList
template <class elemType>
int arrayListType<elemType>::seqSearch(const elemType& item) const
{
int loc;
bool found = false;
for (loc = 0; loc < length; loc++)
if (list[loc] == item)
{
found = true;
break;
}
if (found)
return loc;
else
return -1;
} //end seqSearch
template <class elemType>
void arrayListType<elemType>::insert(const elemType& insertItem)
{
int loc;
if (length == 0) //list is empty
list[length++] = insertItem; //insert the item and
//increment the length
else if (length == maxSize)
cerr << "Cannot insert in a full list." << endl;
else
{
loc = seqSearch(insertItem);
if (loc == -1) //the item to be inserted
//does not exist in the list
list[length++] = insertItem;
else
cerr << "the item to be inserted is already in "
<< "the list. No duplicates are allowed." << endl;
}
} //end insert
template<class elemType>
void arrayListType<elemType>::remove(const elemType& removeItem)
{
int loc;
if (length == 0)
cerr << "Cannot delete from an empty list." << endl;
else
{
loc = seqSearch(removeItem);
if (loc != -1)
removeAt(loc);
else
cout << "The item to be deleted is not in the list."
<< endl;
}
} //end remove
template <class elemType>
arrayListType<elemType>::arrayListType(int size)
{
if (size < 0)
{
cerr << "The array size must be positive. Creating "
<< "an array of size 100. " << endl;
maxSize = 100;
}
else
maxSize = size;
length = 0;
list = new elemType[maxSize];
assert(list != NULL);
}
template <class elemType>
arrayListType<elemType>::~arrayListType()
{
delete[] list;
}
template <class elemType>
arrayListType<elemType>::arrayListType
(const arrayListType<elemType>& otherList)
{
maxSize = otherList.maxSize;
length = otherList.length;
list = new elemType[maxSize]; //create the array
assert(list != NULL); //terminate if unable to allocate
//memory space
for (int j = 0; j < length; j++) //copy otherList
list[j] = otherList.list[j];
} //end copy constructor
template <class elemType>
const arrayListType<elemType>& arrayListType<elemType>::operator=
(const arrayListType<elemType>& otherList)
{
if (this != &otherList) //avoid self-assignment
{
delete[] list;
maxSize = otherList.maxSize;
length = otherList.length;
list = new elemType[maxSize]; //create the array
assert(list != NULL); //if unable to allocate memory
//space, terminate the program
for (int i = 0; i < length; i++)
list[i] = otherList.list[i];
}
return *this;
}
#endif
Explanation / Answer
#include <iostream>
using namespace std;
class AddressType
{
//Access - Specifier
public:
//Varibale Declaration
string streetAddress;
string city;
string state;
string zip;
void setStreesAddress(string address){
streetAddress =address;
}
void setCity(string city){
city =city;
}
void setSatte(string state){
state =state;
}
void setZip(string zip){
city =city;
}
AddressType(string streetAddress,string city,string state,string zip){
streetAddress=streetAddress;
city=city;
state=state;
zip=zip;
}
};
int main() {
// your code goes here
return 0;
}
#include <iostream>
using namespace std;
class ExtPersonType : public PersonType ,public dateType,public AddressType{
};
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.