60 likes | 193 Views
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
E N D
Review for Final Neil Tang04/27/2010 CS223 Advanced Data Structures and Algorithms
Course Survey Please complete the course survey at: http://www.cs.montana.edu/survey/ CS223 Advanced Data Structures and Algorithms
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
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
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
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