Description
Rules:
1. Must be properly APA Formatted
2. Must show understanding in context subject
3. Must be at least 3pages each of content
4. Must include proper references
5. IP1 and IP2 Must be submitted within 12hrs from now..... The rest u can submit before deadline is over... Will pay an extra 10$ as tip if you show understanding in the subject area.
Unformatted Attachment Preview
Purchase answer to see full attachment
Explanation & Answer
the final part is here unit 4 and 5 please review them and let me if you need ny revision
Running Head: Java Console Program
1
Java Console Program
Course number and name
Project name
Your name
Date
Java Console Program
After sorting by last name:
David Baker Box State Trading Corporation
Colin Brown Easy Rug Cleaners
Jennifer Davis Quicker Span Reviews
Mary Edwards Simple Byte Technologies
Ruby Flynn Snap Sun Services
Sheila Garcia Clear Blue Window Cleaning
Susan Hernandez Light Table Bearings
Lee Hill Round Rock Engineers
Douglas Ingram Quicker Cupcakes
Rosy King Shots Manufacturing
Conner Lee Cash Pad Loans
Bob Lewis Code Planet Properties
Colt Lopez Case Electronics
Michelle Martin Diamond Post Surveys
Zion Miller Switch Pen Company
Calvin Morris Zippy Sandwiches
Vicky Perez Lime Cake Records
Stephen Phillips Brown Technologies
Willa Roberts Low Sky Seating Company
Chris Robinson Finch Products
Catherine Smith Side Sauce Spices
Brooklynn Taylor Prism Globe Inc
Eddie Vazquez Osweep Industries
Tiana Williams Country Boxes
2
Java Console Program
3
After sorting by ZIP:
Eddie Vazquez Osweep Industries
Michelle Martin Diamond Post Surveys
Ruby Flynn Snap Sun Services
Colin Brown Easy Rug Cleaners
Lee Hill Round Rock Engineers
Tiana Williams Country Boxes
Susan Hernandez Light Table Bearings
Chris Robinson Finch Products
Willa Roberts Low Sky Seating Company
Douglas Ingram Quicker Cupcakes
Sheila Garcia Clear Blue Window Cleaning
Bob Lewis Code Planet Properties
Rosy King Shots Manufacturing
Stephen Phillips Brown Technologies
Conner Lee Cash Pad Loans
David Baker Box State Trading Corporation
Calvin Morris Zippy Sandwiches
Jennifer Davis Quicker Span Reviews
Mary Edwards Simple Byte Technologies
Vicky Perez Lime Cake Records
Catherine Smith Side Sauce Spices
Brooklynn Taylor Prism Globe Inc
Colt Lopez Case Electronics
Zion Miller Switch Pen Company
Java Console Program
4
Running Head: Hash Structure
1
Hash Structure
Course number and name
Project name
Your name
Date
Hash structure
Flow chart representing the operation of a hash structure
Hash key generator
2
Hash structure
3
Java program to implement a hash table data structure for String data.
*
This file defines a HashTable class.
Keys and values in the hash
table
are of type Object. Keys cannot be null. The default constructor
creates a table that initially has 64 locations, but a different
initial size can be specified as a parameter to the constructor.
The table increases in size if it becomes more than 3/4 full.
*/
public class HashTable {
static private class ListNode {
// Keys that have the same hash code are placed together
// in a linked list. This private nested class is used
Hash structure
4
// internally to implement linked lists. A ListNode
// holds a (key,value) pair.
Object key;
Object value;
ListNode next; // Pointer to next node in the list;
// A null marks the end of the list.
}
private ListNode[] table;
private int count;
// The hash table, represented as
// an array of linked lists.
// The number of (key,value) pairs in the
// hash table.
public HashTable() {
// Create a hash table with an initial size of 64.
table = new ListNode[64];
}
public HashTable(int initialSize) {
// Create a hash table with a specified initial size.
// Precondition: initalSize > 0.
table = new ListNode[initialSize];
}
void dump() {
// This method is NOT part of the usual interface for
// a hash table. It is here only to be used for testing
// purposes, and should be removed before the class is
// released for general use. This lists the (key,value)
// pairs in each location of the table.
System.out.println();
for (int i = 0; i < table.length; i++) {
// Print out the location number and the list of
// key/value pairs in this location.
System.out.print(i + ":");
ListNode list = table[i]; // For traversing linked list number i.
while (list != null) {
System.out.print(" (" + list.key + "," + list.value + ")");
list = list.next;
}
System.out.println();
}
} // end dump()
public void put(Object key, Object value) {
// Associate the specified value with the specified key.
// Precondition: The key is not null.
int bucket = hash(key); // Which location should this key be in?
ListNode list = table[bucket]; // For traversing the linked list
// at the appropriate location.
while (list != null) {
// Search the nodes in the list, to see if the key already
exists.
if (list.key.equals(key))
break;
list = lis...