DetailSyl

# DetailSyl - Algorithm Analysis(Detailed Syllabus-Introduction What is algorithm Why analyze algorithms RAM Model of computation Order notations An

This preview shows pages 1–2. Sign up to view the full content.

Algorithm Analysis (Detailed Syllabus) ------------------------------------------------ Introduction: What is algorithm? Why analyze algorithms? RAM Model of computation Order notations An example with different algorithms for the Maximum Subsequent Sum problem. Sorting: Insertion Sort Shell Sort Heap sort Merge Sort Quick Sort, Selection Algorithm Lower bound of sorting Bucket Sort Extension of sorting toward non-comparable objects Disjoint Set ADT: Equivalence relations Dynamic equivalence problem Graph Algorithms: Topological Sort Queue-based topological sort algorithm Shortest Path on un-weighted graph Dijkstra’s algorithm for weighted graph Proof of D’s algorithm Modified D’s algorithm for negative weighted graph D’s algorithm for acyclic graph: Critical path analysis problem All-pairs shortest path Maximum flow problem Minimum Spanning Tree problem: Prim’s and Kruskal’s algorithm Graph Algorithms (continued): DFS algorithm and Finding Articulation points in Bi-connected graph Euler Circuits Finding Strongly connected components Articulation points detection

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/10/2012 for the course CSE 5211 taught by Professor Dmitra during the Spring '12 term at FIT.

### Page1 / 3

DetailSyl - Algorithm Analysis(Detailed Syllabus-Introduction What is algorithm Why analyze algorithms RAM Model of computation Order notations An

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online