Download
review for midterm neil tang 03 04 2010 n.
Skip this Video
Loading SlideShow in 5 Seconds..
Review for Midterm Neil Tang 03/04/2010 PowerPoint Presentation
Download Presentation
Review for Midterm Neil Tang 03/04/2010

Review for Midterm Neil Tang 03/04/2010

124 Vues Download Presentation
Télécharger la présentation

Review for Midterm Neil Tang 03/04/2010

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. Review for Midterm Neil Tang03/04/2010 CS223 Advanced Data Structures and Algorithms

  2. Algorithm Analysis • Asymptotic notations (O, , ): definition, properties • Important functions: polynomial, logN, 2N • Rules • Time complexities of major sorting algorithms: insertion, quick, merge, and heap. • Recursion and the master method • Sum calculation: double-sum and sum of an arithmetic-geometric sequence CS223 Advanced Data Structures and Algorithms

  3. Trees • Basic concepts • Tree traversals • Binary search tree: insert, remove and time complexities • AVL tree: rotation methods • Red-black tree: definition, rotation and color fix methods. CS223 Advanced Data Structures and Algorithms

  4. Heap • Binary heap: insert, deleteMin, percolateUp/Down, buildHeap and time complexities. • Heapsort • An application: find kth largest/smallest element. • D-heap: Definition, how to locate parent and child nodes. CS223 Advanced Data Structures and Algorithms

  5. Hashing • Hash functions • Separate chaining • Open addressing: linear probing, quadratic probing, double-hashing • Load factor, primary/secondary clustering problems • Rehashing: conditions CS223 Advanced Data Structures and Algorithms

  6. Disjoint Set • Implementations: Linked-list and array • Union: basic, union-by-size, union-by-rank • Find: basic, path compression, time complexities CS223 Advanced Data Structures and Algorithms