Addressbook array based list
$10-30 USD
Betalt ved levering
1 Project Overview
We need to keep track of phone numbers. To do this, we will use an array based
list found in chapter 3 of the text book.
Total Points: 40
1.1 Requirement #1
Create a class called AddressBook:
• Attributes:
– All of the variables which are necessary to support this class based on
the template found in Chapter 3
– An array of AddressEntry pointers with a maximum and minimum size
of 500
• Methods: found in the book and shown below. Remember, these methods will
process AddressEntry pointers instead of integers. You may use the functions
in the book in your program but they will not be templated functions, they
will be methods of the AddressBook class. Only the methods shown below
need to be implemented.
– isEmpty
– isFull
– listSize
– maxListSize
– seqSearch (you will use the full name as the AddressEntry value to
check here instead of an integer)
– insertEnd (remember, this will receive a pointer to an AddressEntry
object instead of an integer)
– removeAt
– retrieveAt (remember, this will return a pointer to an AddressEntry
object instead of an integer)
– clearList (remember, you are storing pointers to objects, not static objects, so memory leaks?)
– Default Constructor: Make sure you set the variables appropriately for
an empty list
– Destructor: Make sure you clear out the list of all pointers (don’t forget
about memory leaks)
1.2 Requirement #2
Create a class called Date.
• This class will contain the following attributes:
– month (1-12)
– day (1-31)
– year (1970 - 2020)
• The following methods:
– Create accessors and mutators for each of the above attributes. All mutators should return true if the value was set correctly, and false if not.
Yes, you are doing data validation.
– getDateString(). This function should return a string representing the
date (ex: 2019/01/01 or 01/01/2019)
1.3 Requirement #3
Create a class called AddressEntry. This class will contain the following attributes:
• This class will contain the following attributes:
– fullName
– phoneNumber
– address
– dateOfBirth: data type should be your new Date class
• The following methods:
– Create accessors and mutators for each of the above attributes
– getDateString(). This function should return a string representing the
date (ex: 2019/01/01 or 01/01/2019). Look on the internet as to how to
do this.
– The mutator for dateOfBirth could take three values for month, day
and year. Make sure it returns a boolean false if the values of these
entries are invalid. Use the mutators for the Date class to determine if
these values are correct or not
1.4 Requirement #4
Now, create a main() function which will create an instance of the AddressBook
class and populate it with AddressEntry pointers. Print them, remove some,
find a few (using the full name with the seqSearch function), then clear out the
AddressBook object checking for memory leaks.
Projekt ID: #27394694
Om projektet
10 freelancere byder i gennemsnit $37 timen for dette job
Hi I have done many c++ projects. Kindly contact to share more details about your project in chat. Thank you
Hello Sir/Madam I have read the project description. I have excellent development experience in various Technologies, OOP, Data Structures, Database Driven applications, APIs, Files handling and Data Transformation, Flere
Hello there, I'll help you with your C++ project since i'm proficient in it. Message me so we can start. Best Regards.
I have a expert to soving this type of alogaritms. I have a 5 year experience in c++ programing. I will give best output inshallah. You can contact me and describe more about your project. I will do
Hi, I'm senior programmer having programing skills in multiple languages like c, cpp, c#, Java, python with certified masters degree in Software Engineering. I've done multiple c++ task and projects during my educati Flere
Good afternoon. We are a multidisciplinary development team and we have the skills required to complete this project successfully with the highest quality standards. We estimate to meet the requirements in a period of Flere
