In this version, you are to reimplement the functionality of version 1, but this time using the classes you coded in Lab 3. The basic output is identical to that of version 1, but now: The three parallel arrays are gone — replaced with a single array of type PhonebookEntry. You should be reading in the entries using the read method of your PhonebookEntry class (which in turn uses the read methods of the Name and PhoneNumber classes). Use the equals methods of the Name and PhoneNumber classes in your lookup and reverseLookup methods. Use the toString methods to print out information. Make 100 the capacity of your Phonebook array Throw an exception (of class Exception) if the capacity of the Phonebook array is exceeded. Place a try/catch around your entire main and catch both FileNotFoundExceptions and Exceptions (remember, the order of appearance of the exception types in the catch blocks can make a difference). Do not use BufferedReader while(true) breaks The name of your application class should be Phonebook. Also, you should submit ALL your classes (i.e., Name, Strip off public from all your class definintions Sample Run #1 For example, if the file phonebook.text contains: Arnow David (123)456-7890 Harrow Keith (234)567-8901 Jones Jackie (345)678-9012 Augenstein Moshe (456)789-0123 Sokol Dina (567)890-1234 Tenenbaum Aaron (678)901-2345 Weiss Gerald (789)012-3456 Cox Jim (890)123-4567 Langsam Yedidyah (901)234-5678 Thurm Joseph (012)345-6789 Here is a sample execution of the program. User input is in bold. Your program should replicate the prompts and output: lookup, reverse-lookup, quit (l/r/q)? l last name? Arnow first name? David David Arnow's phone number is (123)456-7890 lookup, reverse-lookup, quit (l/r/q)? r phone number (nnn-nnn-nnnn)? (456)789-0123 (456)789-0123 belongs to Moshe Augenstein lookup, reverse-lookup, quit (l/r/q)? l last name? Weiss first name? Jerrold -- Name not found lookup, reverse-lookup, quit (l/r/q)? l last name? Weiss first name? Gerald Gerald Weiss's phone number is (789)012-3456 lookup, reverse-lookup, quit (l/r/q)? r phone number (nnn-nnn-nnnn)? (111)123-4567 -- Phone number not found lookup, reverse-lookup, quit (l/r/q)? q 3 lookups performed 2 reverse lookups performed Sample Run #2 If the file phonebook.text contains: … … more than 100 names … … … Here is a sample execution of the program. User input is in bold. Your program should replicate the prompts and output: *** Exception *** Phonebook capacity exceeded - increase size of underlying array Sample Run #3 If the file phonebook.text is missing: Here is a sample execution of the program. User input is in bold. Your program should replicate the prompts and output: *** IOException *** phonebook.text (No such file or directory) name class: import java.io.*; import java.util.*; public class Name { public Name(String last, String first) { this.last = last; this.first = first; } public Name(String first) { this("", first); } public boolean equals(Name same) { return first.equals(same.first) && last .equals(same.last); } public String toString() { return first + " " + last; } public String getFormal() { return first + " " + last; } public String getOfficial() { return last + ", " + first; } public static Name read(Scanner scan) { if (!scan.hasNext()) return null; String first = scan.next(); String last = scan.next(); return new Name(first, last); } public String getInitials() { return Character.toUpperCase(first.charAt(0)) + "." + Character.toUpperCase(last.charAt(0))+"."; } private String last, first; public static void main(String [] args) throws Exception { Scanner scan = new Scanner(new File("names.text")); int count = 0; Name readName = read(scan); Name readLastName =null; while(readName != null) { if(readLastName!=null && readName!=null && readLastName.equals(readName)){ System.out.println("Duplicate name \""+readName+"\" discovered"); } else{ System.out.println("name: " + readName); System.out.println("formal: " + readName.getFormal()); System.out.println("official: " + readName.getOfficial()); System.out.println("initials: " + readName.getInitials()); System.out.println(); } count++; readLastName= readName; readName = read(scan); } System.out.println("---"); System.out.println(count + " names processed."); } }
In this version, you are to reimplement the functionality of version 1, but this time using the classes you coded in Lab 3. The basic output is identical to that of version 1, but now:
The three parallel arrays are gone — replaced with a single array of type PhonebookEntry.
You should be reading in the entries using the read method of your PhonebookEntry class (which in turn uses the read methods of the Name and PhoneNumber classes).
Use the equals methods of the Name and PhoneNumber classes in your lookup and reverseLookup methods.
Use the toString methods to print out information.
Make 100 the capacity of your Phonebook array
Throw an exception (of class Exception) if the capacity of the Phonebook array is exceeded.
Place a try/catch around your entire main and catch both FileNotFoundExceptions and Exceptions (remember, the order of appearance of the exception types in the catch blocks can make a difference).
Do not use
BufferedReader while(true)
breaks
The name of your application class should be Phonebook. Also, you should submit ALL your classes (i.e., Name, Strip off public from all your class definintions
Sample Run #1
For example, if the file phonebook.text contains:
Arnow David (123)456-7890 Harrow Keith (234)567-8901 Jones Jackie (345)678-9012 Augenstein Moshe (456)789-0123 Sokol Dina (567)890-1234 Tenenbaum Aaron (678)901-2345 Weiss Gerald (789)012-3456 Cox Jim (890)123-4567 Langsam Yedidyah (901)234-5678 Thurm Joseph (012)345-6789
Here is a sample execution of the program.
User input is in bold. Your program should replicate the prompts and output:
lookup, reverse-lookup, quit (l/r/q)? l
last name? Arnow
first name? David
David Arnow's phone number is (123)456-7890
lookup, reverse-lookup, quit (l/r/q)? r
phone number (nnn-nnn-nnnn)? (456)789-0123
(456)789-0123 belongs to Moshe Augenstein
lookup, reverse-lookup, quit (l/r/q)? l
last name? Weiss
first name? Jerrold
-- Name not found
lookup, reverse-lookup, quit (l/r/q)? l
last name? Weiss
first name? Gerald
Gerald Weiss's phone number is (789)012-3456
lookup, reverse-lookup, quit (l/r/q)? r
phone number (nnn-nnn-nnnn)? (111)123-4567
-- Phone number not found
lookup, reverse-lookup, quit (l/r/q)? q
3 lookups performed
2 reverse lookups performed
Sample Run #2
If the file phonebook.text contains:
… … more than 100 names … … …
Here is a sample execution of the program.
User input is in bold. Your program should replicate the prompts and output:
*** Exception *** Phonebook capacity exceeded - increase size of underlying array
Sample Run #3
If the file phonebook.text is missing:
Here is a sample execution of the program.
User input is in bold. Your program should replicate the prompts and output:
*** IOException *** phonebook.text (No such file or directory)
name class:
import java.io.*;
import java.util.*;
public class Name {
public Name(String last, String first) {
this.last = last;
this.first = first;
}
public Name(String first) {
this("", first);
}
public boolean equals(Name same) {
return first.equals(same.first) && last .equals(same.last);
}
public String toString() {
return first + " " + last;
}
public String getFormal() {
return first + " " + last;
}
public String getOfficial() {
return last + ", " + first;
}
public static Name read(Scanner scan) {
if (!scan.hasNext())
return null;
String first = scan.next();
String last = scan.next();
return new Name(first, last);
}
public String getInitials() {
return Character.toUpperCase(first.charAt(0)) + "." + Character.toUpperCase(last.charAt(0))+".";
}
private String last, first;
public static void main(String [] args) throws Exception {
Scanner scan = new Scanner(new File("names.text"));
int count = 0;
Name readName = read(scan);
Name readLastName =null;
while(readName != null) {
if(readLastName!=null && readName!=null && readLastName.equals(readName)){
System.out.println("Duplicate name \""+readName+"\" discovered");
}
else{
System.out.println("name: " + readName);
System.out.println("formal: " + readName.getFormal());
System.out.println("official: " + readName.getOfficial());
System.out.println("initials: " + readName.getInitials());
System.out.println();
}
count++;
readLastName= readName;
readName = read(scan);
}
System.out.println("---");
System.out.println(count + " names processed.");
}
}
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 6 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)