HASHING: Dictionary ADT, Introduction-Static Hashing- Hash Table- Hash Functions- Secure Hash Function- Overflow Handling- Theoretical Evaluation of Overflow Techniques, Dynamic Hashing- Motivation for Dynamic Hashing -Dynamic Hashing Using Directories- Directory less Dynamic Hashing.
UNIT-II PRIORITY QUEUES: Priority Queue ADT, Model, Simple Implementation, Binary Heap, Applications of Priority Queues- The Selection Problem Event Simulation Problem, Heap Sort, Binomial Queues- Binomial Queue Structure – Binomial Queue Operation- Implementation of Binomial Queues.
EFFICIENT BINARY SEARCH TREES: 105 Binary Search Tree, AVL Tree, Insertion into a AVL Tree, Deletion from a AVL Tree, Red Black Trees, Definition, Representation of a Red- Black Tree, searching a Red-Black Tree, Inserting into a Red Black Tree, Deletion from a Red Black Tree.
MULTIWAY SEARCH TREES: M-Way Search Trees, Definition and Properties- Searching an M-Way Search Tree, B-Trees, Definition and Properties- Number of Elements in a B-tree- Insertion into B-Tree- Deletion from a B-Tree- B+-Tree Definition- Searching a B+-Tree- Insertion into B+-tree- Deletion from a B+-Tree.
DIGITAL SEARCH STRUCTURES: Digital Search Trees, Definition- Search, Insert and Delete- Binary tries and Patricia, Binary Tries, Compressed Binary Tries- Patricia, Multiway Tries- Definitions- Searching a Trie Sampling Strategies- Insertion into a Trie- Deletion from a Trie- Keys with Different Length Height of a Trie- Space Required and Alternative Node Structure- Prefix Search and Applications- Compressed Tries- Compressed Tries With Skip Fields- Compressed Tries With Labelled Edges- Space Required by a Compressed Tries.