Project

Hi there

 

I need someone to help me to do a project by using Java NetBeans .

 

I attached all  details in a file.

  

Thx

Project1/Contact Manager Project Details x
Project Overview
Write a command-line program that maintains the names and email addresses of your friends and relatives (i.e. a contacts book).
Contact Manager Project Details
Submission
Submit a zip file containing your Eclipse project.
Grading
The assignment will be graded according to how much of the complete application you are able to develop. The +/- is given based on:
· how clean, elegant and readable your code is
· all methods have appropriate Javadoc comments and method code is commented as needed to make the developer’s intent clear 
Ranges
1. A: Completed to step #3 and handles contacts with the same first name, last name, or email address.
2. A-: Completed to step #3.
3. B+, B, B-: Completed to step #2
4. C+, C, C-: Completed to step #1
5. D, D-: Some code is submitted, but it does not run.
6. F: Didn’t submit the project.

Contact Manager Project Details
Your contact book must support the following operations:
· Enter a contact
· Delete a contact
· Modify a contact
· Find a contact by:
· First name
· Last name
· Email address
· List all the contacts in ascending order by either:
· First name
· Last name
· Email address
· Save to a comma-separated-values (CSV) file
· Read in values from a CSV file
· (Optional) Handles cases where the first name, last name or email address is a duplicate (e.g. two contacts with the first name “Bill”)
Project Design
Your project is expected to have a design similar to that given by the UML diagram below. There are three possible versions of the program:
1. An application that uses sequential search of a list (Grade: “C”-range)
2. An application that uses the node-based binary search tree implementation given in the textbook (Grade: “B”-range)
3. An application that uses an array-based binary search tree implementation as described on page 449 of the textbook (Grade: “A”-range)

Tips
· Your application is expected to contain one implementation of the BST ADT, however you will want to have multiple instances to handle finding by different keys and returning the list of contacts in sorted order.
· A simple way to handle a modify operation is to delete the changed entry and add the revised entry (i.e. a delete and then an add)
· You will need to consider how to handle duplicates in your BST. For example, several contacts may have the same zip code and they must all appear in the BST. Although the implementation in the textbook does not allow for duplicates, the textbook does talk about how to handle this situation.
· You can assume that the read-in CSV file will not have any intentional errors. The focus of the project is binary search trees and sorting, not how robust your data import/output code is. If your program can handle the provided example file you should be fine.
Suggested Development Process
1. Create the Contact and ContactBook. The application uses sequential search to find contacts.
2. Create a BinarySearchTreeTextbook class that is the node-based implementation of a BST.
3. Create a BinarySearchTreeArray class that is an array-based implementation of a BST.  
Data
· data.csv

Project1/ContactManagerDesign.PNG

Project1/data.csv
Adams,Andrew,1234 A Street,Ellensburg,Washington,98934,509 555 1234,adams@gmail.com
Brown,Beverly,1235 B Street,Seattle,Washington,98934,509 555 1236,brown@gmail.com
Cooliage,Cam,1236 C Street,Yakima,Washington,98934,510 555 1234,cool@gmail.com
Denison,Derek,1237 D Street,North Bend,Washington,98934,510 555 1236,den@gmail.com
Erickson,Enos,1238 E Street,Wenachee,Washington,98934,511 555 1234,erikson@gmail.com
Firbanks,Fred,1239 F Street,Cle Elum,Washington,98934,511 555 1236,fairbanks@gmail.com
Graham,Gilda,1240 G Street,Selah,Washington,98934,512 555 1234,gman@gmail.com
Howard,Hermione,1241 H Street,Kittitas,Washington,98934,512 555 1236,howyoudoing@gmail.com
Ironhorse,India,1242 I Street,Auburn,Washington,98934,513 555 1234,neigh@gmail.com
Jensen,Jacob,1243 J Street,Renton,Washington,98934,513 555 1236,jensman@gmail.com