17.3. Midterm 2¶
17.3.1. Midterm 2¶
17.3.1.1. Midterm 2¶
Scheduled for Tuesday, November 7
17.3.1.2. What to study (1)¶
Chapter 7: HeapsChapter 8: Sorting\(O(n^2)\) sorts: Insertion sort, Bubble Sort, Selection SortCost of exchange sortingShellsort\(O(n \log n)\) sorts: Mergesort, Quicksort, HeapsortBinsort and Radix SortProof that Sorting lower bound is :math:`O(n log n)’.Chapter 9: File ProcessingMemory hierarchy: RAM vs Disk DrivesBuffer Pools
17.3.1.3. What to study (2)¶
Chapter 10: HashingHash FunctionsOpen hashing vs. bucket hashing vs. closed hashingCollision resolution methods: linear probing, linear probing by steps, pseudo-random probing, quadratic probing, double hashingDeletion
