Lecture 10: Hash Functions, Polynomial Hash Codes, Separate Chaining [Advanced Data Structures]

In this lecture we continue our exploration of hashing. We discuss what a hash function is, make some attempts at designing different hash codes, and come up with a fairly simple and standard one that works well in practice. Then we move to our first collision resolution policy, separate chaining. To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content: PATREON: https://www.patreon.com/PageWizard SUBSCRIBESTAR: https://www.subscribestar.com/drpage PAYPAL: https://paypal.me/pagewizard?locale.x=en_US Time Stamps: 0:00 Reminder of Hashing and Design Issues 1:45 Definition of Hash Function (Hash code, compression map) 13:55 Polynomial hash code 21:45 Modified Horner's Method for a Hash Function (using poly hash codes) 30:05 Algorithm for computing hash function 40:05 Separate Chaining 44:30 Example, Algorithms for Separate Chaining Want the notes, and/or want to support my mission? Look no further, get the written companion to this video lectures series. Buy the book, Advanced Data Structures: An Introduction to Data Structures and Algorithms, it is available at the below links (by format, given in parentheses): -Amazon (Paperback & Kindle): http://mybook.to/advanceddatastructures -Patreon & Subscribestar (Personally-signed PDF copy, support my work at the General Support Level): https://www.patreon.com/PageWizard https://www.subscribestar.com/drpage #CompSci #Hashing #DataStructures