Question

I am implementing the below steps of an algorithm , i have implemented first 3 steps successfully , and i have doubt in the last step , i am unable to understand the notation used to represent the hash function , what do i exactly need to pass as argument is the below given hash functions (last step).
Thanks in advance.

Answer 1

There are no hash functions given. Only signatures. You’d have to find hash functions which satisfy the signatures.

Some hints on how to read the signatures

Functions whose domain is given by a Cartesian product (e.g. A x B x C) work like this. Each factor is a set. The function takes as many parameters as are factors involved in the Cartesian product. The i’th parameter has to be in the i’th set of the Cartesian product.

Example

f: N x R x N -> R

Reads like

real f (int a, real b, int c)

The range can also be expressed by means of a Cartesian product in which case the function returns vectors of values from the corresponding sets.