Analysis of Algorithm Covered Course Outline. <|> Content Updated
21st JANUARY 2005
Covered Course Outline
Covered Topics Represent in Green Colour. Advance algorithm and design techniques
• Running time calculation
• Logarithm in the running time
• Lists, stacks and queues
• Introduction to trees
Introduction to searching techniques
• Algorithm for depth first search
• Algorithm for breadth first search
• Depth limited search
• Iterative deepening search
• Heuristic search
• Algorithm for best first search
Algebraic algorithm
• Introduction to NP completeness
• Easy vs. Hard
• NP Complete problems
• Probabilistic and parallel algorithm problems
Sorting algorithm
• Insertion Sort
• Heap Sort
• Merge Sort
• Quick Sort
• Sorting large records
Recommended Books
1. “Analysis of algorithm”; Robert Sedgewick & Phillippe
2. “Data structure and algorithm analysis”; Mark Allen Weiss
3. “Data structure and algorithm analysis with C+ +”; Mark Allen Weiss