DAA Assignment-II

1. What is an algorithm? Explain the notion of algorithm with an example.
2. Explain in brief about ‘Algorithm design and analysis process’ with a neat flowchart.
3. Explain ‘Asymptotic Notations’ with definition and examples.
4. Discuss the ‘Algorithm Analysis Framework’ in brief.
5. Discuss basic efficiency classes.
6. Discuss the algorithms specifications.
7. Discuss General Plan for Analyzing Time Efficiency of Recursive Algorithms.
8. Discuss General Plan for Analyzing Time Efficiency of Nonrecursive Algorithms.
9. Write an algorithm to check whether all the elements in a given array are distinct and find its time complexity.
10. Write an algorithm to find the product of two matrices A and B and find its time complexity.
11. Write recursive algorithm to compute factorial of n and find its time complexity.
12. Discuss and find the time complexity of “Tower of Hanoi” puzzle.
13. Discuss divide-and-conquer algorithm design technique with example.
14. Write recursive algorithm to find maximum and minimum of given list of array elements using divide and conquer technique.
15. Write recursive and non-recursive algorithms for binary search.
16. Write Merge Sort algorithm to find its worst case time efficiency.
17. Write Quick Sort algorithm to find its best case time efficiency.
18. Apply Quick Sort on the given list and draw recursive call tree:  5  3 1  9  8 2 4  7