Operations
To insert a record with Ki as key, compute h(Ki) which gives the address of the bucket for the record. If there is space in the bucket then it is stored that bucket. (else chaining?)
To lookup a record with key Ki, compute h(ki). Check with every record in the bucket to obtain the record.
To delete a similar hash, find and delete is followed.