Lecture 7: Hashing, Hash Functions
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: October 2005, views: 42991
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
"Today starts a two-lecture sequence on the topic of hashing, which is a really great technique that shows up in a lot of places. So we're going to introduce it through a problem that comes up often in compilers called the symbol table problem. And the idea is that we have a table S holding n records where each record, just to be a little more explicit here. So each record typically has a bunch of, this is record x. x is usually a pointer to the actual data. So when we talk about the record x, what it usually means some pointer to the data. And in the data, in the record, so this is a record, there is a key called a key of x..."
Download slides: mit6046jf05_leiserson_lec07_01.pdf (223.1 KB)
Download mit6046jf05_leiserson_lec07_01.m4v (Video - generic video source 163.9 MB)
Download mit6046jf05_leiserson_lec07_01.rm (Video - generic video source 124.2 MB)
Download mit6046jf05_leiserson_lec07_01.flv (Video 218.0 MB)
Download mit6046jf05_leiserson_lec07_01.wmv (Video 674.0 MB)
Download mit6046jf05_leiserson_lec07_01.mp3 (Audio lecture 18.0 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !