1) describe the asymptotic notations used for best case average case and worst case analysis of algorithm.
2) prepare down the algorithm for determining maximum element of array; perform best and average case complexity with suitable order notations.
3) prepare down an algorithm to determine mean and variance of an array perform best, worst and average case complexity, defining the notations used for each type of analysis.
4) Derive recurrence relation for Fibonacci series, perform complexity analysis for the same.
5) Describe the various asymptotic notations with the properties.
6) Describe linear search with ex.
7) Describe divide and conquer algorithms.
8) What do you mean by Merge Sort
9) Define Binary Search
10) What can we say about the average case efficiency of binary search?