Question

The method where the key value is moved from both ends is called as?
a. division remainder method
b. mid square method
c. folding method
d. shifting method
​

Answer 1

Answer:

***Answer is (b) options

mid square method

correct answer above...... ✍️

Explanation:

hope it's help. please thank me all answer.............❤️

Answer 2

Answer:

The method where the key value is moved from both ends is called as shifting method.

Explanation:

In the shifting method, both the key-values are moved from the respective ends.

This method is used in hashing and there are two ways to implement it.

The first way is to use the fold shift and another is the fold boundary.

Fold Shift

In this method, the key is divided into fixed-size parts whose size matches the required address, and later those parts are added together to get the required output.

For example:

Key:  987456321 and the size of the required address is 3 digits.

987+456+321= 1764.

Now to get the size of three you are free to remove either the least significant bit or most signifcant bit. So the key would be 764 or 176respectively.

Fold Boundary

It is also similar to the first method except that here we don't discard LSB or MSB rather we fold them into the middle part. Let's understand with an example.

For example:

Key:  987456321 and the size of the required address is 3 digits.

789+456+123= 1368.

Now either discard 1 or 8 and the rest part is your output.

#SPJ3