using C++; Using classes and linked lists, design an online address book to keep

Question

using C++;

Using classes and linked lists, design an online address book to keep track of the names, addresses, phone numbers, and dates of birth of family members, close friends, and certain business associates. Your program should be able to handle as many entries as required.

Define a 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 member variables.

Define a class extPersonType using the class personType (as defined in Example 10-10, Chapter 10), the class dateType (as designed in chapter 11’s Programming Exercise 2), and the class addressType. Add a member variable to this class to classify the person as a family member, friend, or business associate. Also, add a member variable to store the phone number. Add (or override) the functions to print and store the appropriate information. Use constructors to automatically initialize the member variables.

Define the class addressBookType using the previously defined classes. An object of the type addressBookType should be able to process as many entries as required.

        The program should perform the following operations:

i. Load the data into the address book from a disk.

ii. Sort the address book by last name.

  iii.         Search for a person by last name.

Print the address, phone number, and date of birth (if it exists) of a given person.

Print the names of the people whose birthdays are in a given month.

Print the names of all the people between two last names.

Depending on the user’s request, print the names of all family members, friends, or business associates.

Add or delete a new entry to the address book.

Allow the user to save the data in the address book.

Note that your program must use classes, linked lists, as well as at least one of searching and one of sorting algorithms discussed in the class. However, sequential search and sort algorithms cannot be used in this task due to its high time and space computational complex.  

Explanation / Answer

}

__________________________________

Related Questions

Navigate

• Browse (All)
• Browse U
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.