Question
*****I posted the completed code for part 1**** Help me with part 2 at the bottom. Can you please write a code Java for the
*****I posted the completed code for part 1****
Help me with part 2 at the bottom. Can you please write a code Java for the LQHashed class SP2017LAB6_LQHashedDataStructure_yourLastName
OBJECTIVES
Doing this lab, students have the chance to:
-Review the concept of Hashtable data structures
-Know how to implement the Java Hashtable class: use functions, put, get, remove, etc.
-Know how to read the information of the object from an input file, place to the Hashtable object and write the information of all the nodes in the structure to the file before terminating the program -Know how to display all the nodes in the Hashtable on the screen
Part1: Java class Hashtable
REQUIREMENT
The company A stores the information of all employees in the text file named as employeeInfo.txt. The information of each employee is written on one line in the following format, for example:
For the employee:
Bill - White 0012345 Marketing department 45000 Or for the employee with the tittle:
Nancy Nguyen 1234567 Sale department 40000 - Manager
The application will use Hashtable object as data structure then open and read the file employeeInfo.txt The information of each line of the file employeeInfo.txt as a node to be inserted to the data structure. After reading the file, ensure all the information of employees or title employees are stored in the data structure by showing all nodes.
Provide the menu to allow users to select the following tasks. After finishing each task, re-display the menu to allow user to continue using the application:
1.Insert employee or employee with title
2.Fetch
3.Encapsulation
4.Update
5.Delete
6.Show all
7.Exit
//INSERT data to the Hashtable
-Allow users to enter the information of an employee or an employee with the title from the keyboard
-Create the object then insert to the data structure
-Users can continue inputing until users want to stop
//FETCH data
-Allow users to type an employee id then read the information from the data structure to print out the information on the screen
//ENCAPSULATION
-Allow users to type an employee id from the keyboard. Using the entered employee id to read the information of the node from data structure then assign the information to the node named temp.
Change the salary of the node temp
-Fetch the node with the entered employee id again then compare its salary with the salary of the node
temp. . If the salary are different then display the message box: The Java Hashtable structure has the encapsulation; otherwise display the message box: The Java Hashtable structure does not have the encapsulation
//UPDATE data
Display the message to ask users to enter the employee id. Using the employee id to read the node out the data structure. Asking for the new department from the keyboard. Change the department with the new department. Display the node from the data structure to check new updated information
//DELETE data
Display the message to ask users to enter the employee id. Remove the node with the entered employee id
//SHOW ALL
Display all the nodes are currently stored in the data structure
//Exit program
When users choose to exit the program, open the file employeeInfo.txt to write and write all the information of employee nodes stored in the data structure to the file employeeInfo.txt Close file
ANALYZING AND DESIGNING
-Draw the UML of class Employee_yourLastName and class TitleEmployee_yourLastName
-Write the pseudo-code of the main()
WHAT YOU NEED TO KNOW TO DO THE LAB
-Review how to use the do.. while loop to handle the menu to re-display
-switch statement to handle each task of menu
-How to open the file to read, how to open the file to write, how to read/write from/to the file; how to close the file
-How to declare a data structure of type Hashtable; put, get, remove, etc. the nodes
HOW TO START THE LAB
-You can create the project named FA2016LAB6_PART1 then add the data type class
FA2016LAB6_Employee_yourLastName, FA2016LAB6_TitleEmployee_yourLastName and a driver class FA2016LAB6_HashedDataStructure_yourLastName
public class employee { private String fisrtName,lastName; private int id; private String dept; private int salary; public String getFisrtName() { return fisrtName; } public void setFisrtName(String fisrtName) { this.fisrtName = fisrtName; } public String getLastName() { return lastName; } public void setLastName(String lastName) { this.lastName = lastName; } public int getId() { return id; } public void setId(int id) { this.id = id; } public String getDept() { return dept; } public void setDept(String dept) { this.dept = dept; } public int getSalary() { return salary; } public void setSalary(int salary) { this.salary = salary; }
}
employeeWithTitle.java
public class employeeWithTitle { private String fisrtName,lastName; private int id; private String dept; private int salary; private String title; public String getFisrtName() { return fisrtName; } public void setFisrtName(String fisrtName) { this.fisrtName = fisrtName; } public String getLastName() { return lastName; } public void setLastName(String lastName) { this.lastName = lastName; } public int getId() { return id; } public void setId(int id) { this.id = id; } public String getDept() { return dept; } public void setDept(String dept) { this.dept = dept; } public int getSalary() { return salary; } public void setSalary(int salary) { this.salary = salary; } public String getTitle() { return title; } public void setTitle(String title) { this.title = title; }
}
employeeTest.java
import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.FileReader; import java.io.FileWriter; import java.util.Hashtable; import java.util.Map; import java.util.Scanner;
public class employeeTest {
public static void main(String a[])throws Exception { Hashtable
PART2: Linear Quotient (LQHashed) Data Structure OBJECTIVES Doing this lab, students have the chance to:
-Implement the Linear Quotient (LQHashed) data structure: understand Insert, Fetch, Delete and update algorithm of the LQhashed structure -Know how to display all the nodes in the LQHashed data structure on the screen
REQUIREMENT Provide the application that creates a data structure of type LQHashed then provides the menu that includes the following tasks and allow users to work on each task until users want to exit
1. Insert
2. Fetch
3. Encapsulation
4. Update
5. Delete
6. Show all
INSERT data -read input information of employees or title employees from the keyboard then create the object and add to the data structure until users want to stop.
FETCH data -Display the message to ask for an employee id then Fetch the node from the LQHashed data structure to node named temp and display the information of node ENCAPSULATION -Use the above node fetched from the LQHahsed data structure, change the salary of temp -Fetch employee with the same employee id again to see if they have the same salary then display display the message box: The LQHashed structure has the encapsulation; otherwise display the message box: The LQHashed structure does not have the encapsulation
UPDATE data
-Display the message and read the employee id then fetch the node to node temp
-Read the new department from the keyboard, update the new department to temp
-Update the new node to the data structure
DELETE data -Display the message and read the employee id then using the employee id to delete the node
SHOWALL -Display all the nodes currently stored in the data structure
ANALYZING AND DESIGNING -Write the pseudo-code of the main()
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Project Management in Practice
Authors: Samuel J. Mantel Jr., Jack R. Meredith, Sco
4th edition
470533013, 978-0470533017
