Semester : SEMESTER 3
Subject : Data Structures
Year : 2019
Term : MAY
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 205
Page:3
C1142 Pages 3
87, 99]
What is meant by collision? Give an example. (2)
Explain the four different hashing functions with an example for each. (8)
Given the values {2341, 4234, 2839, 430, 22, 397, 3920} a hash table of size 7
and a hash function h(x) = x mod 7, show the resulting table after inserting the
values in the given order with each of the following collision strategies.
(i) separate chaining
(ii) linear probing
(111) double hashing with second hash function hi(x) = (2x - 1) mod 7. (10)
मे नेप मर بد
Page 3 of 3