# 50+ Hashing Functions MCQs with FREE PDF

We have the best collection of Hashing Functions MCQs and answer with FREE PDF. These Hashing Functions MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Hashing Functions MCQs

#### 1. What is the hash function used in the division method?

a) h(k) = k/m

b) h(k) = k mod m

c) h(k) = m/k

d) h(k) = m mod k

Answer: h(k) = k mod m

#### 2. What can be the value of m in the division method?

a) Any prime number

b) Any even number

c) 2p – 1

d) 2p

#### 3. Which scheme provides good performance?

b) universal hashing

c) hashing by division

d) hashing by multiplication

a) 19

b) 72

c) 15

d) 17

a) 1

b) 4

c) 3

d) 2

#### 6. What is the hash function used in multiplication method?

a) h(k) = floor( m(kA mod 1))

b) h(k) = ceil( m(kA mod 1))

c) h(k) = floor(kA mod m)

d) h(k) = ceil( kA mod m)

Answer: h(k) = floor( m(kA mod 1))

#### 7. What is the advantage of the multiplication method?

a) only 2 steps are involved

b) using constant

c) value of m not critical

d) simple multiplication

Answer: value of m not critical

a) 14

b) 128

c) 49

d) 127

#### 9. What is the value of h(k) for the key 123456?

Given: p=14, s=2654435769, w=32

a) 123

b) 456

c) 70

d) 67

#### 10. Which scheme uses a randomization approach?

a) hashing by division

b) hashing by multiplication

c) universal hashing