Outline of Syllabus
- Basic concepts of Data Representation
- Introduction to Algorithm Design
- Arrays
- Linked List
- Stacks
- Queues
- Trees
- Searching, Sorting and Hashing
- Graphs
Detailed Contents
CHAPTER VIII – SEARCHING, SORTING AND HASHING
- Searching, sorting and hashing
- Linear & Binary Search
- Sorting
- Indexed Search
- Hash Tables and Hashing
- Direct Address tables
- Hash functions
- Division
- Prime division
- Folding
- Mid-square
- Multiplication
- Radix transformation
- Digit re-arrangement
- Hash tables
- Initializing
- Inserting
- Deleting
- Searching
- Resolving collisions
- Chaining
- Open addressing
- Linear probing
- Quadratic probing
- Rehashing