All topics covered in this course are based on the foundational knowledge required for understanding it.
- Linear & Binary search
- Selection Sort & Insertion sort
- Bubble sort
- Quick & Merge Sort
- Recursive or iterative
- Tree
- Tree traversal
- Binary tree
- Binary Search tree
- Search Algorithm
- Tree Sort Algorithm. (Binary, In order Algo)
- Complete Binary tree
- Heap-tree
- Heap-sort
- Graph
Advanced Analysis of Algorithm
Main Topics Covered
- Introduction to the course and the course objectives
- Why Algorithm Analysis
- Algorithm Analysis Techniques and Basic Mathematics
- Recurrence
- Divide and Conquer algorithm design strategy and analysis of recurrences
- Sorting & Search Algorithms
- String Matching
- Dynamic Programming algorithm design strategy
- Greedy Approach Maximum
- Greedy Approach Minimum
- Instance of Knapsack Problem By Branch And Bound Algorithm
- Backtracking
- Longest Common Subsequence
- Maximum Total Cost
- Minimum Total Cost
- Warshalls-algorithm
- Floyd-algorithm
- Graph Algorithms
- Guided Study of some interesting algorithms from the research papers
