1 / 6

Review for Final Neil Tang 04/27/2010

Review for Final Neil Tang 04/27/2010. Course Survey. Please complete the course survey at: http://www.cs.montana.edu/survey/. Time Complexity Analysis. Asymptotic notations (O, ,  ): definition, properties Important functions: polynomial, logN, 2 N 4 Rules

zaynah
Télécharger la présentation

Review for Final Neil Tang 04/27/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 Final Neil Tang04/27/2010 CS223 Advanced Data Structures and Algorithms

  2. Course Survey Please complete the course survey at: http://www.cs.montana.edu/survey/ CS223 Advanced Data Structures and Algorithms

  3. Time Complexity Analysis • Asymptotic notations (O, , ): definition, properties • Important functions: polynomial, logN, 2N • 4 Rules • Recursion and the master method CS223 Advanced Data Structures and Algorithms

  4. Graphs • Basic concepts • Adjacency matrix and list • Topological sort • BFS, DFS and their applications (strong connected components) • Shortest path: Dijkstra’s algorithm, the Bellman-Ford algorithm, implementation. CS223 Advanced Data Structures and Algorithms

  5. Graphs • Minimum spanning tree: Prim’s algorithm, Kruskal’s algorithm, implementation. • Maximum flow: The Ford-Furkerson algorithm, implementation. • Time complexities CS223 Advanced Data Structures and Algorithms

  6. Algorithm Design Techniques • Dynamic programming: Recursive equation evaluation, all-pairs shortest path, ordering matrix multiplications. • Divide and conquer: Quick/merge sort, integer/matrix multiplication. • Greedy algorithm: Examples, bin packing algorithms. • Time complexity analysis CS223 Advanced Data Structures and Algorithms

More Related