Telephone lookup problem Program plan: Main.java Create a class named “Main”. Inside the class, Define the “main ()” method. Prompt the user to enter the phonebook file name. Create object for lookup table. Create a file reader object Read the contents of the table. Prompt user to enter the choice. Based on the choice the values are searched and displayed. Prompt the required details and display the required. Item.java Create a class named “Item”. Inside the class, Declare the required variables Declare the array. Declare the constructor and initialize the required variables. Define the method “getKey” Return the key value. Define the method “getValue” Return the value. Define the method “compareTo()” Perform the comparison Return the key and value pairs. LookupTable.java Create a class named “LookupTable”. Inside the class, Declare the required array variables Declare the constructor and initialize the required variables. Define the method “read()” Get the key and value. Add the key and value Sort the values based on the key and values. Define the method “lookup()” Perform the search operation Condition to validate the value and return the required value. Define the method “reverseLookup()” Perform the search based on the key and value pair. Return the values based on the key and value pair.

Question

Want to see the full answer?

Answer 1

Question

Chapter 14, Problem 8PE

Program Plan Intro

Telephone lookup problem

Program plan:

Main.java

Create a class named “Main”. Inside the class,

Define the “main ()” method.

Prompt the user to enter the phonebook file name.

Create object for lookup table.

Create a file reader object

Read the contents of the table.

Prompt user to enter the choice.

Based on the choice the values are searched and displayed.

Prompt the required details and display the required.

Item.java

Create a class named “Item”. Inside the class,

Declare the required variables

Declare the array.

Declare the constructor and initialize the required variables.

Define the method “getKey”

Return the key value.

Define the method “getValue”

Return the value.

Define the method “compareTo()”

Perform the comparison

Return the key and value pairs.

LookupTable.java

Create a class named “LookupTable”. Inside the class,

Declare the required array variables

Declare the constructor and initialize the required variables.

Define the method “read()”

Get the key and value.

Add the key and value

Sort the values based on the key and values.

Define the method “lookup()”

Perform the search operation

Condition to validate the value and return the required value.

Define the method “reverseLookup()”

Perform the search based on the key and value pair.

Return the values based on the key and value pair.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

make corrections of this program based on the errors shown. this is CIS 227 .

Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal. Create 2 groups: marketing and research. Add Shamir, Jose, and Kate to the marketing group. Add Don, Liz, and Sal to the research group. Create a shared directory for each group. Create two files to put into each directory: spreadsheetJanuary.txt meetingNotes.txt Assign access permissions to the directories: Groups should have Read+Write access Leave owner permissions as they are “Everyone else” should not have any access Submit for grade: Screenshot of /etc/passwd contents showing your new users Screenshot of /etc/group contents showing new groups with their members Screenshot of shared directories you created with files and permissions

⚫ your circuit diagrams for your basic bricks, such as AND, OR, XOR gates and 1 bit multiplexers, ⚫ your circuit diagrams for your extended full adder, designed in Section 1 and ⚫ your circuit diagrams for your 8-bit arithmetical-logical unit, designed in Section 2. 1 An Extended Full Adder In this Section, we are going to design an extended full adder circuit (EFA). That EFA takes 6 one bit inputs: aj, bj, Cin, Tin, t₁ and to. Depending on the four possible combinations of values on t₁ and to, the EFA produces 3 one bit outputs: sj, Cout and rout. The EFA can be specified in principle by a truth table with 26 = 64 entries and 3 outputs. However, as the EFA ignores certain inputs in certain cases, it is easier to work with the following overview specification, depending only on t₁ and to in the first place: t₁ to Description 00 Output Relationship Ignored Inputs Addition Mode 2 Coutsjaj + bj + Cin, Tout= 0 Tin 0 1 Shift Left Mode Sj = Cin, Cout=bj, rout = 0 rin, aj 10 1 1 Shift Right…