1 / 6

Review for Midterm Neil Tang 03/04/2010

Review for Midterm Neil Tang 03/04/2010. Algorithm Analysis. Asymptotic notations (O, ,  ): definition, properties Important functions: polynomial, logN, 2 N Rules Time complexities of major sorting algorithms: insertion, quick, merge, and heap. Recursion and the master method

faye
Download Presentation

Review for Midterm Neil Tang 03/04/2010

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

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

More Related