1.What is the average time complexity of Insertion sort
a).O(1) b).O(n) c).O(n^2) d). depends on size of array
2. Representation of data structure in memory is known as:
a). Recursion b). File Structure c). ADT d). asymptotic-notation
3.Using RAM model, in how many steps does the statement A[i] = B[i][j] + C will be executed? _________
4. The relation 5n^2 + 6 = O(n^3) is correct? True / False
5. Choose the correct statement about the characteristics of ADT?
i) It exports a type. ii) It exports a set of operations.
a)i only b) ii only c)i & ii both d)None
6. Apply master Theorem to solve the running time for recurrence
T(n) = 2T(n/2) + O(n)
ANSWERS
1.c 2.c 3.6 4.T 5.c 6.nlogn
Expertvision 