Lecture 16
This week we will be studying Hash tables
and hashing techniques. Today I described the basic objectives of hashing, that
is transforming a search key so that it can be used to index in an array of
reasonable size. We saw some techniques used to design hashing functions. When
two or more distinct keys has to the same index we get what is known as a
collision.
On Wednesday I will discuss some ways in which collisions are resolved.
The material on hashing is
found in chapter 20 of our text. You should read the entire chapter.
Posted: Mon - February 14, 2005 at 11:55 AM