Q.1 What do you understand by the algorithm? What are the characteristics of a good algorithm?
Q.2 How do you determine the complexity of the algorithm? What is the relation between time and space complexities of the algorithm? Justify the answer with the ex.
Q.3 Compare two functions n2 and 2n for several values of n. Find out when second becomes larger than first.
Q.4 Why do we apply asymptotic notation in a study of algorithm? describe commonly used asymptotic notations and give their importance.
Q.5 prepare procedures / Algorithm to insert and delete the element into an array.
Q6. prepare the algorithm for binary search. What are the conditions under which sequential search of a list is preferred over binary search?
Q7. Define the following terms:
i) Abstract data type.
ii) Column major ordering for arrays.
iii) Row major ordering for arrays.
Q.8 Describe the following:
i) Analysis of algorithm.
ii) The space-time trade off algorithm.
iii) Complexity of an Algorithm.
Q9. Define the term sparse matrix. Describe various types of sparse matrices? Evaluate the method to compute address of any element ajk of a matrix stored in memory.
Q.10 A linear array A is given with lower bound as 1. If address of A[25] is 375 and A[30] is 390, then find address of A[16].