Using C++

 

Suppose you are implementing a dynamic set of student records as a hash table. Each record has an integer key. Key can have values from 0 through 65,536 and no two records can have the same key values. In addition to the key, each record has following information. Name: GPA: Academic level: Even though the key can take a value between 0 and 65536, this university can have max 10000 students at a given time. Hash Table Implementation Details: Assume that the hash key is k mod m and using chaining in case of a collision. Also, the size (m) of the hash table is 1000. Also, you can assume that keys for student are generated using a random uniform distribution function.

 

C or C++ program that Implements the hash table construction for the above scenario and then implement the following three functions a) INSERT(T, x) // insert the student record x to the table b) DELETE(T, x) // delete the student record x from the table c) SEARCH(T, k) //search key k in the hash table

SophiaPretty

(5)

Status NEW Posted 18 Nov 2017 11:11 AM My Price 6.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)

• Buy Answer