Implement the perfect hashed data structure discussion in this chapter and provi
ID: 3603179 • Letter: I
Question
Implement the perfect hashed data structure discussion in this chapter and provide an application that demonstrates that its four basic operation methods function properly. Your application should store nodes for a stadium tickets application where the ticket numbers range from 2000 to 100,000 for a 60,000 seat stadium. The ticket number will be the key field and the nodes will also store the purchaser’s name. See figure 5.4 for a description of the field widths. DON'T USE HashMap or Hashtable in the code !!!!!!!!!!!!!!!!
Explanation / Answer
public class HashedClass{ int ticketNumber; // keyfield string purchaserName; Hashtable hashtable = new Hashtable(); insert(); fetch(); delete(); update(); }