About this document
Data Structures: Unit 1 Overview by Laxmi Venki is a document available to read on EtoBox.
Unit 1 discusses dictionaries and hash tables. Dictionaries store key-value pairs and allow searching by key in O(1) time using a hash function to map keys to array positions. Collisions occur when different keys hash to the same position and are resolved using open or closed hashing techniques like linear probing. Rehashing moves elements to a larger table when the current table becomes too full to maintain fast search times.
- Author
- Laxmi Venki
- Language
- EN