Dynamic File Organization Using Hashing
Offered By: NPTEL-NOC IITM via YouTube
Course Description
Overview
Explore dynamic file organization techniques using hashing in this 42-minute lecture from NPTEL-NOC IITM. Delve into static and dynamic hashing methods, including extendable hashing and linear hashing. Learn about quebit sequences, two-bit and three-bit sequences, and their applications in file organization. Understand deletion processes and examine a detailed example of dynamic hashing. Investigate linear hashing techniques, proofs, and insertion algorithms to enhance your knowledge of efficient file management strategies.
Syllabus
Introduction
Static hashing
Dynamic file organization
extendable hashing and linear hashing
quebit sequence
extendable fashion
two bit sequence
three bit sequence
deletion
detailed example
linear fashion
proof
insertion algorithm
Taught by
NPTEL-NOC IITM
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera