Skip to content

CE205 Data Structures

Week-15

Hashing Techniques for Expandable Files,Tries, Approximate String Matching, Trie Hashing, Seconday Key Retrieval (2), File Sorting

Download DOC, SLIDE, PPTX

Outline

  • Hashing Techniques for Expandable Files
  • Extendible Hashing
  • Dynamic Hashing
  • Linear Hashing

Outline

  • Other Tree Structures
  • Tries
  • Approximate String Matching
  • Trie Hashing
  • PATRICIA Trees
  • Digital Search Trees

Outline

  • Seconday Key Retrieval (2)
  • K-d trees
  • Grid Files

Outline

  • File Sorting
  • Insertion Sort
  • Quicksort
  • Heapsort
  • External Sorting
  • Sorting by Merging
  • Disk Sort
\[ End-Of-Week-15 \]
Last update: September 25, 2022
Created: December 29, 2021
Back to top